home *** CD-ROM | disk | FTP | other *** search
/ Amiga Format CD 24 / Amiga Format AFCD24 (Feb 1998, Issue 108).iso / -seriously_amiga- / shareware / programming / c / vbcc / machines / m68k / machine.c next >
C/C++ Source or Header  |  1998-01-05  |  103KB  |  2,436 lines
  1. /*  $VER: vbcc (machine.c amiga68k) V0.4    */
  2.  
  3. /*  Code generator for Motorola 680x0 CPUs. Supports 68000-68060+68881/2.   */
  4. /*  PhxAss and the GNU assembler is supported.                              */
  5.  
  6. #include "supp.h"
  7.  
  8. static char FILE_[]=__FILE__;
  9.  
  10. /*  Public data that MUST be there.                             */
  11.  
  12. /* Name and copyright. */
  13. char cg_copyright[]="vbcc code-generator for m68k V1.1a (c) in 1995-97 by Volker Barthelmann";
  14.  
  15. /*  Commandline-flags the code-generator accepts                */
  16. int g_flags[MAXGF]={VALFLAG,VALFLAG,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
  17. char *g_flags_name[MAXGF]={
  18.     "cpu","fpu","d2scratch","noa4","sc","sd","prof","const-in-data",
  19.     "use-framepointer","no-addressing-modes","no-delayed-popping",
  20.     "gas","branch-opt","no-fp-return","no-mreg-return","g"};
  21.  
  22. union ppi g_flags_val[MAXGF];
  23.  
  24. /*  Alignment-requirements for all types in bytes.              */
  25. zlong align[16];
  26.  
  27. /*  Alignment that is sufficient for every object.              */
  28. zlong maxalign;
  29.  
  30. /*  CHAR_BIT of the target machine.                             */
  31. zlong char_bit;
  32.  
  33. /*  Sizes of all elementary types in bytes.                     */
  34. zlong sizetab[16];
  35.  
  36. /*  Minimum and Maximum values each type can have.              */
  37. /*  Must be initialized in init_cg().                           */
  38. zlong t_min[32];
  39. zulong t_max[32];
  40.  
  41. /*  Names of all registers.                                     */
  42. char *regnames[MAXR+1]={"noreg","a0","a1","a2","a3","a4","a5","a6","a7",
  43.                                "d0","d1","d2","d3","d4","d5","d6","d7",
  44.                         "fp0","fp1","fp2","fp3","fp4","fp5","fp6","fp7"};
  45.  
  46. /*  The Size of each register in bytes.                         */
  47. zlong regsize[MAXR+1];
  48.  
  49. /*  Type which can store each register. */
  50. struct Typ *regtype[MAXR+1];
  51.  
  52. /*  regsa[reg]!=0 if a certain register is allocated and should */
  53. /*  not be used by the compiler pass.                           */
  54. int regsa[MAXR+1]={0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
  55.  
  56. /*  Specifies which registers may be scratched by functions.    */
  57. int regscratch[MAXR+1]={0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0};
  58.  
  59.  
  60. /****************************************/
  61. /*  Some private data and functions.    */
  62. /****************************************/
  63.  
  64. static long malign[16]=  {1,1,2,2,2,2,2,1,2,1,1,1,2,1};
  65. static long msizetab[16]={0,1,2,4,4,4,8,0,4,0,0,0,4,0};
  66.  
  67. static struct Typ ltyp={LONG},larray={ARRAY,<yp};
  68.  
  69. static char reglist[200];
  70.  
  71. #define DATA 0
  72. #define BSS 1
  73. #define CODE 2
  74.  
  75. static int reglabel,freglabel,section=-1;
  76. static char *codename,*bssname,*dataname;
  77.  
  78. static void probj2(FILE *,struct obj *,int);
  79. static struct IC *do_refs(FILE *,struct IC *);
  80. static void pr(FILE *,struct IC *);
  81. static int get_reg(FILE *,int,struct IC *);
  82. static long pof2(zulong);
  83. static void function_top(FILE *,struct Var *,long);
  84. static void function_bottom(FILE *f,struct Var *,long);
  85.  
  86. static void saveregs(FILE *,struct IC *),restoreregsa(FILE *,struct IC *);
  87. static void restoreregsd(FILE *,struct IC *);
  88.  
  89. static void assign(FILE *,struct IC *,struct obj *,struct obj *,int,long,int);
  90. static int compare_objects(struct obj *o1,struct obj *o2);
  91.  
  92. static int is_const(struct Typ *t);
  93.  
  94. static char x_s[]={'0','b','w','3','l'};
  95. static char x_t[]={'?','b','w','l','l','s','d','v','l','a','s','u','e','f','?','?'};
  96.  
  97. static char *quick[2]={"","q"};
  98. static char *strshort[2]={"l","w"};
  99.  
  100. static char *ubranch[]={"eq","ne","cs","cc","ls","hi"};
  101.  
  102. static int pushedreg,stored_cc; /* pushedreg&2: aregsaved; 4: dreg; 8: freg */
  103.                                 /* 16: durch RESTOREREGS gepushed           */
  104. static int pushlabel,pushflag;
  105. static int geta4;
  106.  
  107. #define D16OFF 1024
  108.  
  109. static int newobj=0;   /*  um zu erkennen, ob neue section erlaubt ist */
  110.  
  111. static int gas,dbout;
  112.  
  113. static int isquickkonst(union atyps *,int),isquickkonst2(union atyps *,int),regavailable(int);
  114. static void move(FILE *,struct obj *,int,struct obj *,int,int);
  115. static void add(FILE *,struct obj *,int,struct obj *,int,int);
  116. static void sub(FILE *,struct obj *,int,struct obj *,int,int);
  117. static void mult(FILE *,struct obj *,int,struct obj *,int,int,int,struct IC *);
  118.  
  119. static long pof2(zulong x)
  120. /*  Yields log2(x)+1 oder 0. */
  121. {
  122.     zulong p;int ln=1;
  123.     p=ul2zul(1L);
  124.     while(ln<=32&&zulleq(p,x)){
  125.         if(zuleqto(x,p)) return(ln);
  126.         ln++;p=zuladd(p,p);
  127.     }
  128.     return(0);
  129. }
  130.  
  131. #define isreg(x) ((p->x.flags&(REG|DREFOBJ))==REG)
  132.  
  133. #define PEA 1000
  134.  
  135. static int addressing(void);
  136. static long notpopped,dontpop,stackoffset,loff;
  137. static int offlabel,regoffset;
  138. /*  For keeping track of condition codes.   */
  139. static struct obj *cc_set,*cc_set_tst;
  140. static int cc_typ,cc_typ_tst;
  141.  
  142. static int pget_reg(FILE *f,int flag,struct IC *p)
  143. {
  144.     int i;
  145.     flag=1+flag*8;
  146.     for(i=flag;i<flag+8;i++){
  147.         if(regs[i]==1&&(!p||(i!=p->q1.reg&&i!=p->q2.reg&&i!=p->z.reg))){
  148.             if(p){
  149.                 if((p->q1.am&&(p->q1.am->dreg==i||p->q1.am->basereg==i))
  150.                  ||(p->q2.am&&(p->q2.am->dreg==i||p->q2.am->basereg==i))
  151.                  ||(p->z.am&&(p->z.am->dreg==i||p->z.am->basereg==i))){
  152.                     continue;
  153.                 }
  154.             }
  155.             regs[i]+=8;if(!pushlabel) {pushlabel=++label;pushflag=1;}
  156.             fprintf(f,"\tmove.l\t%s,l%d\n",regnames[i],pushlabel);
  157.             if(i<9) pushedreg|=2;
  158.             else if (i<17) pushedreg|=4;
  159.             else pushedreg|=8;
  160.             return(i);
  161.         }
  162.     }
  163.     ierror(0);
  164. }
  165. static int get_reg(FILE *f,int flag,struct IC *p)
  166. /*  Gets a register: flag=0=areg, 1=dreg, 2=fpreg           */
  167. {
  168.     int i;
  169.     flag=1+flag*8;
  170.     for(i=flag;i<flag+8;i++){
  171.         if(regs[i]==0){
  172.             if(p){
  173.                 if((p->q1.am&&(p->q1.am->dreg==i||p->q1.am->basereg==i))
  174.                  ||(p->q2.am&&(p->q2.am->dreg==i||p->q2.am->basereg==i))
  175.                  ||(p->z.am&&(p->z.am->dreg==i||p->z.am->basereg==i))){
  176. /*                    iwarning("%s used in get_reg(1)",regnames[i]);*/
  177.                     continue;
  178.                 }
  179.             }
  180.             regs[i]=2;pushedreg|=1;
  181.             if(!regused[i]&&!regscratch[i]){regused[i]=1; }
  182.             return(i);
  183.         }
  184.     }
  185.     for(i=flag;i<flag+8;i++){
  186.         if(regs[i]==1&&(!p||(i!=p->q1.reg&&i!=p->q2.reg&&i!=p->z.reg))){
  187.             if(p){
  188.                 if((p->q1.am&&(p->q1.am->dreg==i||p->q1.am->basereg==i))
  189.                  ||(p->q2.am&&(p->q2.am->dreg==i||p->q2.am->basereg==i))
  190.                  ||(p->z.am&&(p->z.am->dreg==i||p->z.am->basereg==i))){
  191. /*                    iwarning("%s used in get_reg(2)",regnames[i]);*/
  192.                     continue;
  193.                 }
  194.             }
  195.             regs[i]+=4;
  196.             if(i<17) {fprintf(f,"\tmove.l\t%s,-(a7)\n",regnames[i]);stackoffset-=4;}
  197.              else {fprintf(f,"\tfmove.x\t%s,-(a7)\n",regnames[i]);stackoffset-=12;}
  198. /*            if(p->code==COMPARE) ierror("corrupt code for compare generated - sorry");*/
  199.             if(i<9) pushedreg|=2;
  200.             else if (i<17) pushedreg|=4;
  201.             else pushedreg|=8;
  202.             return(i);
  203.         }
  204.     }
  205.     ierror(0);
  206. }
  207. static int isquickkonst(union atyps *p,int t)
  208. /*  Returns 1 if constant is between -128 and 127.   */
  209. {
  210.     zlong zl;zulong zul;
  211.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE) return 0;
  212.     eval_const(p,t);
  213.     if(t&UNSIGNED){
  214.         zul=ul2zul(127UL);
  215.         return(zulleq(vulong,zul));
  216.     }else{
  217.         zl=l2zl(-129L);
  218.         if(zlleq(vlong,zl)) return(0);
  219.         zl=l2zl(127L);
  220.         return(zlleq(vlong,zl));
  221.     }
  222. }
  223. static int isquickkonst2(union atyps *p,int t)
  224. /*  Returns 1 if constant is between 1 and 8.   */
  225. {
  226.     zlong zl;zulong zul;
  227.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE) return 0;
  228.     eval_const(p,t);
  229.     if(t&UNSIGNED){
  230.         if(zuleqto(ul2zul(0UL),vulong)) return(0);
  231.         zul=ul2zul(8UL);
  232.         return(zulleq(vulong,zul));
  233.     }else{
  234.         if(zleqto(l2zl(0L),vlong)) return(0);
  235.         zl=l2zl(-1L);
  236.         if(zlleq(vlong,zl)) return(0);
  237.         zl=l2zl(8L);
  238.         return(zlleq(vlong,zl));
  239.     }
  240. }
  241. static int regavailable(int art)
  242. /*  Returns true if matching register is available.     */
  243. {
  244.     int i;
  245.     art=1+art*8;
  246.     for(i=art+1;i<art+8;i++)
  247.         if(regs[i]==0) return(1);
  248.     return(0);
  249. }
  250. static int compare_objects(struct obj *o1,struct obj *o2)
  251. /*  Tests if two objects are equal.     */
  252. {
  253.     if(o1->flags==o2->flags&&o1->am==o2->am){
  254.         if(!(o1->flags&VAR)||(o1->v==o2->v&&zleqto(o1->val.vlong,o2->val.vlong))){
  255.             if(!(o1->flags®)||o1->reg==o2->reg){
  256.                 return(1);
  257.             }
  258.         }
  259.     }
  260.     return(0);
  261. }
  262. static struct IC *do_refs(FILE *f,struct IC *p)
  263. /*  Loads DREFOBJs into address registers, if necessary.    */
  264. /*  Small constants are loaded into data registers if this  */
  265. /*  improves code.                                          */
  266. {
  267.     int reg,c=p->code,t=p->typf,equal;
  268.     if((p->q1.flags&DREFOBJ)&&(!(p->q1.flags®)||p->q1.reg<1||p->q1.reg>8)){
  269.         equal=0;
  270.         if(compare_objects(&p->q1,&p->q2)) equal|=1;
  271.         if(compare_objects(&p->q1,&p->z)) equal|=2;
  272.         reg=get_reg(f,0,p);
  273.         p->q1.flags&=~DREFOBJ;
  274.         fprintf(f,"\tmove.l\t");probj2(f,&p->q1,t);
  275.         p->q1.flags=REG|DREFOBJ;
  276.         p->q1.reg=reg;
  277.         fprintf(f,",%s\n",regnames[p->q1.reg]);
  278.         if(equal&1) p->q2=p->q1;
  279.         if(equal&2) p->z=p->q1;
  280.     }
  281.     if((p->q2.flags&DREFOBJ)&&(!(p->q2.flags®)||p->q2.reg<1||p->q2.reg>8)){
  282.         if(compare_objects(&p->q2,&p->z)) equal=1; else equal=0;
  283.         reg=get_reg(f,0,p);
  284.         p->q2.flags&=~DREFOBJ;
  285.         fprintf(f,"\tmove.l\t");probj2(f,&p->q2,t);
  286.         p->q2.flags=REG|DREFOBJ;
  287.         p->q2.reg=reg;
  288.         fprintf(f,",%s\n",regnames[p->q2.reg]);
  289.         if(equal) p->z=p->q2;
  290.     }
  291.     if((p->z.flags&DREFOBJ)&&(!(p->z.flags®)||p->z.reg<1||p->z.reg>8)){
  292.         reg=get_reg(f,0,p);
  293.         p->z.flags&=~DREFOBJ;
  294.         fprintf(f,"\tmove.l\t");probj2(f,&p->z,t);
  295.         p->z.flags=REG|DREFOBJ;
  296.         p->z.reg=reg;
  297.         fprintf(f,",%s\n",regnames[p->z.reg]);
  298.     }
  299.     if(g_flags_val[0].l!=68040){
  300.     /*  Don't do it on 040 because it's slower. */
  301.         if(x_t[t&NQ]=='l'&&(t&NQ)!=FLOAT&&(c!=ASSIGN||!isreg(z))&&
  302.            c!=MULT&&c!=DIV&&c!=MOD&&c!=LSHIFT&&c!=RSHIFT&&c!=SETRETURN&&c!=PUSH&&c!=ADDI2P&&c!=SUBIFP&&
  303.            (!(p->z.flags®)||p->z.reg<9||p->z.reg>16)){
  304.             /*  Constants into registers.    */
  305.             if((p->q1.flags&KONST)&&isquickkonst(&p->q1.val,t)&&((c!=ADD&&c!=SUB&&c!=ADDI2P&&c!=SUBIFP)||!isquickkonst2(&p->q1.val,t))){
  306.                 eval_const(&p->q1.val,t);
  307.                 if((!zdeqto(d2zd(0.0),vdouble)||!zleqto(l2zl(0L),vlong)||!zuleqto(ul2zul(0UL),vulong))&®available(1)){
  308.                     reg=get_reg(f,1,p);
  309.                     move(f,&p->q1,0,0,reg,t);
  310.                     p->q1.flags=REG;p->q1.reg=reg;
  311.                     p->q1.val.vlong=l2zl(0L);
  312.                 }
  313.             }
  314.             if((p->q2.flags&KONST)&&isquickkonst(&p->q2.val,t)&&((c!=ADD&&c!=SUB&&c!=ADDI2P&&c!=SUBIFP)||!isquickkonst2(&p->q2.val,t))){
  315.                 eval_const(&p->q2.val,t);
  316.                 if((!zdeqto(d2zd(0.0),vdouble)||!zleqto(l2zl(0L),vlong)||!zuleqto(ul2zul(0UL),vulong))&®available(1)){
  317.                     reg=get_reg(f,1,p);
  318.                     move(f,&p->q2,0,0,reg,t);
  319.                     p->q2.flags=REG;p->q2.reg=reg;
  320.                     p->q2.val.vlong=l2zl(0L);
  321.                 }
  322.             }
  323.         }
  324.     }
  325.     return(p);
  326. }
  327. static void pr(FILE *f,struct IC *p)
  328. /*  Release registers and pop them from stack if necessary. */
  329. {
  330.     int i,size=0;
  331.     /*  To keep track of condition codes.   */
  332.     if((pushedreg&12)&&(p->code==TEST||p->code==COMPARE)){
  333.         char *fp;struct IC *branch;
  334.         if(g_flags_val[1].l>=68000&&((p->typf&NQ)==FLOAT||(p->typf&NQ)==DOUBLE)) fp="f"; else fp="";
  335.         branch=p;
  336.         while(branch->code<BEQ||branch->code>=BRA) branch=branch->next;
  337.         if((p->typf&UNSIGNED)||(p->typf&NQ)==POINTER){
  338.             fprintf(f,"\ts%s\t-2(a7)\n",ubranch[branch->code-BEQ]);
  339.         }else{
  340.             fprintf(f,"\t%ss%s\t-2(a7)\n",fp,ename[branch->code]+1);
  341.         }
  342.         stored_cc=1;
  343.     }
  344.     for(i=MAXR;i>0;i--){
  345.         if(regs[i]==2) regs[i]=0;
  346.         if(regs[i]&8){
  347.             regs[i]&=~8;
  348.             fprintf(f,"\tmove.l\tl%d,%s\n",pushlabel,regnames[i]);
  349.             if(i>=9) cc_set=0;
  350.         }
  351.         if(regs[i]&4){
  352.             regs[i]&=~4;
  353.             if(i<17) {fprintf(f,"\tmove.l\t(a7)+,%s\n",regnames[i]);stackoffset+=4;size+=4;}
  354.              else {fprintf(f,"\tfmove.x\t(a7)+,%s\n",regnames[i]);stackoffset+=12;size+=12;}
  355.             if(i>=9) cc_set=0;
  356.         }
  357.     }
  358.     if((pushedreg&12)&&(p->code==TEST||p->code==COMPARE))
  359.         fprintf(f,"\ttst.b\t-%d(a7)\n",size+2);
  360. }
  361. static void probj2(FILE *f,struct obj *p,int t)
  362. /*  Write object.   */
  363. {
  364.     if(p->am){
  365.     /*  Addressing modes.   */
  366.         if(g_flags[9]&USEDFLAG) {ierror(0);p->am=0;return;}
  367.         if(p->am->skal>=0){
  368.             long l=0;
  369.             if(p->flags&D16OFF) l=zl2l(p->val.vlong);
  370.             fprintf(f,"(%ld,%s",p->am->dist+l,regnames[p->am->basereg]);
  371.             if(p->am->dreg){
  372.                 fprintf(f,",%s",regnames[p->am->dreg&127]);
  373.                 if(p->am->dreg&128) fprintf(f,".w"); else fprintf(f,".l");
  374.                 if(p->am->skal) fprintf(f,"*%d",p->am->skal);
  375.             }
  376.             fprintf(f,")");
  377.             return;
  378.         }
  379.         if((p->flags&D16OFF)&&!zleqto(l2zl(0L),p->val.vlong)) ierror(0);
  380.         if(p->am->skal==-1){
  381.             fprintf(f,"(%s)+",regnames[p->am->basereg]);
  382.             return;
  383.         }
  384.         if(p->am->skal==-2){    /*  Noch nicht implementiert    */
  385.             fprintf(f,"-(%s)",regnames[p->am->basereg]);
  386.             return;
  387.         }
  388.     }
  389.     if(p->flags&DREFOBJ){
  390.         fprintf(f,"(");
  391.         if((p->flags&D16OFF)&&!zleqto(l2zl(0L),p->val.vlong))
  392.             {printval(f,&p->val,LONG,0);fprintf(f,",");}
  393.     }
  394.     if(p->flags&VARADR) fprintf(f,"#");
  395.     if(p->flags&VAR) {
  396.         if(p->v->storage_class==AUTO||p->v->storage_class==REGISTER){
  397.             if(p->flags®){
  398.                 fprintf(f,"%s",regnames[p->reg]);
  399.             }else{
  400.                 long os;
  401.                 os=zl2l(p->val.vlong);
  402.                 if(!(g_flags[8]&USEDFLAG)){
  403.                     if(!zlleq(l2zl(0L),p->v->offset)) os=os+loff-zl2l(p->v->offset);
  404.                      else              os=os+zl2l(p->v->offset);
  405.                     fprintf(f,"(%ld+l%d,a7)",os-stackoffset,offlabel);
  406.                 }else{
  407.                     if(!zlleq(l2zl(0L),p->v->offset)) os=os-zl2l(p->v->offset)+4;
  408.                      else              os=os-(zl2l(p->v->offset)+zl2l(szof(p->v->vtyp)));
  409.                     fprintf(f,"(%ld,a5)",os);
  410.                 }
  411.             }
  412.         }else{
  413.             if(!zleqto(l2zl(0L),p->val.vlong)){printval(f,&p->val,LONG,0);fprintf(f,"+");}
  414.             if(p->v->storage_class==STATIC&&(p->v->vtyp->flags&NQ)!=FUNKT){
  415.                 fprintf(f,"l%ld",zl2l(p->v->offset));
  416.             }else{
  417.                 fprintf(f,"_%s",p->v->identifier);
  418.             }
  419.             if((g_flags[5]&USEDFLAG)&&!(p->flags&VARADR)&&(p->v->vtyp->flags&NQ)!=FUNKT&&((g_flags[7]&USEDFLAG)||!is_const(p->v->vtyp)) )
  420.                 fprintf(f,"(a4)");
  421.         }
  422.     }
  423.     if((p->flags®)&&!(p->flags&VAR)) fprintf(f,"%s",regnames[p->reg]);
  424.     if(p->flags&KONST){
  425.         /*  This requires IEEE floats/doubles on the host compiler. */
  426.         if(t==FLOAT||t==DOUBLE){
  427.             unsigned char *ip=(unsigned char *)&p->val.vfloat;
  428.             char *s;
  429.             if(gas) s="0x"; else s="$";
  430.             fprintf(f,"#%s%02x%02x%02x%02x",s,ip[0],ip[1],ip[2],ip[3]);
  431.             if(t==DOUBLE){
  432.                 if(DEBUG&1) printf("doubleconst=%f\n",p->val.vdouble);
  433.                 fprintf(f,"%02x%02x%02x%02x",ip[4],ip[5],ip[6],ip[7]);
  434.             }
  435.         }else {fprintf(f,"#");printval(f,&p->val,t&NU,0);}
  436.     }
  437.     if(p->flags&DREFOBJ) fprintf(f,")");
  438. }
  439. static char tsh[]={'w','l'};
  440. static int proflabel;
  441. static void function_top(FILE *f,struct Var *v,long offset)
  442. /*  Writes function header. */
  443. {
  444.     geta4=0;
  445.     if(gas){
  446.     }else{
  447.         if(g_flags[NQ]&USEDFLAG) fprintf(f,"\tsymdebug\n");
  448.         if(g_flags_val[0].l!=68000) fprintf(f,"\tmachine\t%ld\n",g_flags_val[0].l);
  449.         if(g_flags_val[1].l>68000) fprintf(f,"\tfpu\t1\n");
  450.         if(g_flags[4]&USEDFLAG) fprintf(f,"\tnear\tcode\n");
  451.         if(g_flags[5]&USEDFLAG) fprintf(f,"\tnear\ta4,-2\n");
  452.         fprintf(f,"\topt\t0\n\topt\tNQLPSM");
  453.         if(g_flags_val[0].l!=68040) fprintf(f,"R");
  454.         if((g_flags[12]&USEDFLAG)||(optflags&2)) fprintf(f,"BT");
  455.         fprintf(f,"\n");
  456.     }
  457.     if(section!=CODE){fprintf(f,codename);section=CODE;}
  458.     if(g_flags[6]&USEDFLAG){
  459.         proflabel=++label;
  460.         if(gas){
  461.             fprintf(f,"l%d:\n\t.byte\t\"%s\",0\n",proflabel,v->identifier);
  462.         }else{
  463.             fprintf(f,"l%d\n\tdc.b\t\"%s\",0\n",proflabel,v->identifier);
  464.         }
  465.     }
  466.     if(v->storage_class==EXTERN){
  467.         if(gas){
  468.             fprintf(f,"\t.global\t_%s\n",v->identifier);
  469.         }else{
  470.             fprintf(f,"\tpublic\t_%s\n",v->identifier);
  471.         }
  472.     }
  473.     if(gas){
  474.         fprintf(f,"\t.align\t4\n_%s:\n",v->identifier);
  475.     }else{
  476.         fprintf(f,"\tcnop\t0,4\n_%s\n",v->identifier);
  477.     }
  478.     if(g_flags[6]&USEDFLAG){
  479.         if(gas){
  480.             fprintf(f,"\tpea\tl%d\n\t.global\t__startprof\n\tjbsr\t__startprof\n\taddq.w\t#4,a7\n",proflabel);
  481.         }else{
  482.             fprintf(f,"\tpea\tl%d\n\tpublic\t__startprof\n\tjsr\t__startprof\n\taddq.w\t#4,a7\n",proflabel);
  483.         }
  484.     }
  485.     offset=-((offset+4-1)/4)*4;
  486.     loff=-offset;offlabel=++label;
  487.     if(!(g_flags[8]&USEDFLAG)){
  488.         if(offset<0) fprintf(f,"\tsub%s.%s\t#%ld,a7\n",quick[offset>=-8],strshort[offset>=-32768],-offset);
  489.     }else{
  490.         if(offset>=-32768||g_flags_val[0].l>=68020){
  491.             fprintf(f,"\tlink.%c\ta5,#%ld\n",tsh[offset<-32768],offset);
  492.         }else{
  493.             fprintf(f,"\tlink.w\ta5,#-32768\n");offset+=32768;
  494.             fprintf(f,"\tsub.%c\t#%ld,a5\n",tsh[offset<-32768],offset);
  495.         }
  496.     }
  497.     if(g_flags_val[1].l>68000&&float_used){
  498.         if(gas){
  499.             fprintf(f,"\t.word\t0xf227,l%d\n",freglabel);
  500.         }else{
  501.             fprintf(f,"\tfmovem.x\tl%d,-(a7)\n",freglabel);
  502.         }
  503.     }
  504.     if(gas){
  505.         fprintf(f,"\tmovem.l\t#l%d,-(a7)\n",reglabel);
  506.     }else{
  507.         fprintf(f,"\tmovem.l\tl%d,-(a7)\n",reglabel);
  508.     }
  509. }
  510. static void function_bottom(FILE *f,struct Var *v,long offset)
  511. /*  Writes function footer. */
  512. {
  513.     int i,size=0;unsigned int pushval,popval;
  514.     *reglist=0;
  515.     pushval=popval=0;
  516.     for(i=1;i<=16;i++){
  517.         if((regused[i]&&!regscratch[i]&&!regsa[i])||(i==5&&geta4)){
  518.             if(*reglist) strcat(reglist,"/");
  519.             strcat(reglist,regnames[i]);
  520.             if(i<9){  pushval|=(256>>i);popval|=(128<<i);}
  521.               else {  pushval|=(0x8000>>(i-9));popval|=(1<<(i-9));}
  522.             size+=4;
  523.         }
  524.     }
  525.     if(gas){
  526.         if(popval) fprintf(f,"\t.equ\tl%d,%u\n\tmovem.l\t(a7)+,#%u\n",reglabel,pushval,popval);
  527.             else fprintf(f,"\t.equ\tl%d,0\n",reglabel);
  528.     }else{
  529.         if(*reglist) fprintf(f,"l%d\treg\t%s\n\tmovem.l\t(a7)+,l%d\n",reglabel,reglist,reglabel);
  530.             else fprintf(f,"l%d\treg\n",reglabel);
  531.     }
  532.     *reglist=0;pushval=0xe000;popval=0xd000;
  533.     for(i=17;i<=MAXR;i++){
  534.         if(regused[i]&&!regscratch[i]&&!regsa[i]){
  535.             if(*reglist) strcat(reglist,"/");
  536.             strcat(reglist,regnames[i]);
  537.             pushval|=(1<<(i-17));popval|=(0x80>>(i-17));
  538.             size+=12;
  539.         }
  540.     }
  541.     if(g_flags_val[1].l>68000&&float_used){
  542.         if(gas){
  543.             if(popval!=0xd000) fprintf(f,"\t.equ\tl%d,0x%x\n\t.word\t0xf21f,0x%x\n",freglabel,(int)pushval,(int)popval);
  544.                 else fprintf(f,"\t.equ\tl%d,0xe000\n",freglabel);
  545.         }else{
  546.             if(*reglist) fprintf(f,"l%d\tfreg\t%s\n\tfmovem.x\t(a7)+,l%d\n",freglabel,reglist,freglabel);
  547.                 else fprintf(f,"l%d\tfreg\n",freglabel);
  548.         }
  549.     }
  550.     if(!(g_flags[8]&USEDFLAG)){
  551.         if(loff) fprintf(f,"\tadd%s.%s\t#%ld,a7\n",quick[loff<=8],strshort[loff<32768],loff);
  552.         if(gas){
  553.             fprintf(f,"\t.equ\tl%d,%d\n",offlabel,size);
  554.         }else{
  555.             fprintf(f,"l%d\tEQU\t%d\n",offlabel,size);
  556.         }
  557.     }else fprintf(f,"\tunlk\ta5\n");
  558.     if(g_flags[6]&USEDFLAG){
  559.         if(gas){
  560.             fprintf(f,"\tpea\tl%d\n\t.global\t__endprof\n\tjbsr\t__endprof\n\taddq.w\t#4,a7\n",proflabel);
  561.         }else{
  562.             fprintf(f,"\tpea\tl%d\n\tpublic\t__endprof\n\tjsr\t__endprof\n\taddq.w\t#4,a7\n",proflabel);
  563.         }
  564.     }
  565.     fprintf(f,"\trts\n");
  566. }
  567. static void move(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg,int t)
  568. /*  erzeugt eine move Anweisung...Da sollen mal Optimierungen rein  */
  569. {
  570.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  571.     if(!qreg&&(q->flags&(REG|DREFOBJ))==REG) qreg=q->reg;
  572.     if(zreg==qreg&&zreg) return;
  573.     if(q&&(q->flags&VARADR)&&zreg>=1&&zreg<=8){
  574.         fprintf(f,"\tlea\t");
  575.         q->flags&=~VARADR;probj2(f,q,t);q->flags|=VARADR;
  576.         fprintf(f,",%s\n",regnames[zreg]);
  577.         return;
  578.     }
  579.     if(zreg>=9&&zreg<=16&&q&&(q->flags&KONST)&&isquickkonst(&q->val,t)){
  580.         fprintf(f,"\tmoveq\t");
  581.     }else{
  582.         if(zreg>=17||qreg>=17){
  583.             if(qreg>=17&&zreg>=17) fprintf(f,"\tfmove.x\t");
  584.              else fprintf(f,"\tfmove.%c\t",x_t[t&NQ]);
  585.         }else{
  586.             fprintf(f,"\tmove.%c\t",x_s[msizetab[t&NQ]]);
  587.         }
  588.     }
  589.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj2(f,q,t);
  590.     fprintf(f,",");
  591.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj2(f,z,t);
  592.     fprintf(f,"\n");
  593. }
  594. static void add(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg,int t)
  595. /*  erzeugt eine add Anweisung...Da sollen mal Optimierungen rein   */
  596. {
  597.     if(!qreg&&!q) ierror(0);
  598.     if(!zreg&&!z) ierror(0);
  599.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  600.     if(!qreg&&(q->flags&KONST)&&isquickkonst2(&q->val,t)){
  601.         fprintf(f,"\taddq.%c\t",x_t[t&NQ]);
  602.     }else{
  603.         /*  hier noch Abfrage, ob #c.w,ax   */
  604.         fprintf(f,"\tadd.%c\t",x_t[t&NQ]);
  605.     }
  606.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj2(f,q,t);
  607.     fprintf(f,",");
  608.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj2(f,z,t);
  609.     fprintf(f,"\n");
  610. }
  611. static void sub(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg,int t)
  612. /*  erzeugt eine sub Anweisung...Da sollen mal Optimierungen rein   */
  613. {
  614.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  615.     if(q&&(q->flags&KONST)&&isquickkonst2(&q->val,t)){
  616.         fprintf(f,"\tsubq.%c\t",x_t[t&NQ]);
  617.     }else{
  618.         /*  hier noch Abfrage, ob #c.w,ax   */
  619.         fprintf(f,"\tsub.%c\t",x_t[t&NQ]);
  620.     }
  621.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj2(f,q,t);
  622.     fprintf(f,",");
  623.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj2(f,z,t);
  624.     fprintf(f,"\n");
  625. }
  626. static void mult(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg, int t,int c,struct IC *p)
  627. /*  erzeugt eine mult Anweisung...Da sollen mal Optimierungen rein  */
  628. /*  erzeugt auch div/mod etc.                                       */
  629. {
  630.     int modreg;
  631.     if(!qreg&&(q->flags&(REG|DREFOBJ))==REG) qreg=q->reg;
  632.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  633.     if((c==MULT||c==DIV||c==MOD)&&g_flags_val[0].l<68020&&msizetab[t&NQ]==4){
  634.         if(c==MULT){
  635.         /*  ist das mit get_reg(.,.,0) ok? nochmal ueberdenken...   */
  636.         /*  ...die ganze Routine am besten...                       */
  637.         /*  ...es war nicht, deshalb ist es jetzt geaendert         */
  638.             int dx,dy,t1,t2;
  639.             if(zreg>=9&&zreg<=16){
  640.                 dx=zreg;
  641.             }else{
  642.                 dx=get_reg(f,1,p);
  643.                 move(f,z,0,0,dx,t);
  644.             }
  645.             if(qreg>=9&&qreg<=16&&qreg!=dx){
  646.                 dy=qreg;
  647.             }else{
  648.                 dy=get_reg(f,1,p);
  649.                 move(f,q,0,0,dy,t);
  650.             }
  651.             t1=get_reg(f,1,p);t2=get_reg(f,1,p);
  652.             if(t1==dx||t2==dx||t1==dy||t2==dy) ierror(0);
  653.             fprintf(f,"\tmove.l\t%s,%s\n",regnames[dx],regnames[t1]);
  654.             fprintf(f,"\tmove.l\t%s,%s\n",regnames[dy],regnames[t2]);
  655.             fprintf(f,"\tswap\t%s\n",regnames[t1]);
  656.             fprintf(f,"\tswap\t%s\n",regnames[t2]);
  657.             fprintf(f,"\tmulu.w\t%s,%s\n",regnames[dy],regnames[t1]);
  658.             fprintf(f,"\tmulu.w\t%s,%s\n",regnames[dx],regnames[t2]);
  659.             fprintf(f,"\tmulu.w\t%s,%s\n",regnames[dy],regnames[dx]);
  660.             fprintf(f,"\tadd.w\t%s,%s\n",regnames[t2],regnames[t1]);
  661.             fprintf(f,"\tswap\t%s\n",regnames[t1]);
  662.             fprintf(f,"\tclr.w\t%s\n",regnames[t1]);
  663.             fprintf(f,"\tadd.l\t%s,%s\n",regnames[t1],regnames[dx]);
  664.             if(zreg!=dx) move(f,0,t1,z,0,t);
  665.         }else ierror(0);
  666.         return;
  667.     }
  668.     if(c==MULT){
  669.         /*  das duerfte nur der Aesthetik dienen... */
  670.         if(t&UNSIGNED) fprintf(f,"\tmulu.%c\t",x_t[t&NQ]); else fprintf(f,"\tmuls.%c\t",x_t[t&NQ]);
  671.     }
  672.     if(c==DIV){
  673.         if(t&UNSIGNED) fprintf(f,"\tdivu.%c\t",x_t[t&NQ]); else fprintf(f,"\tdivs.%c\t",x_t[t&NQ]);
  674.     }
  675.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj2(f,q,t);
  676.     fprintf(f,",");
  677.     /*  eigentlich muss zreg!=0 sein...     */
  678.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj2(f,z,t);
  679.     fprintf(f,"\n");
  680. }
  681. static struct IC *am_freedreg[9],*am_shiftdreg[9];
  682. static struct IC *am_dist_ic[9],*am_dreg_ic[9],*am_use[9];
  683. /*  am_dist_ic und am_dreg_ic werden auch fuer (ax)+ benutzt    */
  684. static long am_dist[9],am_dreg[9],am_base[9],am_inc[9],am_skal[9],am_dbase[9];
  685. #define AMS sizeof(struct AddressingMode)
  686.  
  687. static void clear_am(int reg)
  688. /*  loescht Werte fuer erweiterte Adressierungsarten fuer Register reg  */
  689. {
  690.     if(reg<0||reg>16) ierror(0);
  691.     if(DEBUG&32) printf("clear_am(%s)\n",regnames[reg]);
  692.     if(reg<=8){
  693.         am_dist_ic[reg]=am_dreg_ic[reg]=am_use[reg]=0;
  694.         am_dist[reg]=am_dreg[reg]=am_base[reg]=am_inc[reg]=0;
  695.     }else{
  696.         reg-=8;
  697.         am_freedreg[reg]=am_shiftdreg[reg]=0;
  698.         am_skal[reg]=am_dbase[reg]=0;
  699.     }
  700. }
  701. static int addressing(void)
  702. /*  Untersucht ICs auf erweiterte Addresierungsarten    */
  703. {
  704.     struct IC *p;int count,localused=0;
  705.     if(DEBUG&32) printf("addressing() started\n");
  706.     for(count=1;count<=16;count++) clear_am(count);
  707.     for(count=0,p=first_ic;p;p=p->next){
  708.         int c=p->code,q1reg,q2reg,zreg;
  709.         if(p->q1.flags®) q1reg=p->q1.reg; else q1reg=0;
  710.         if(p->q2.flags®) q2reg=p->q2.reg; else q2reg=0;
  711.         if(p->z.flags®) zreg=p->z.reg; else zreg=0;
  712.         if(c==ADDI2P) c=ADD;
  713.         if(c==SUBIFP) c=SUB;
  714.         if(DEBUG&32) pric2(stdout,p);
  715.         if(!localused){
  716.             if((p->q1.flags&(VAR|REG))==VAR&&(p->q1.v->storage_class==AUTO||p->q1.v->storage_class==REGISTER)&&p->q1.v->offset>=0)
  717.                 localused=1;
  718.             if((p->q2.flags&(VAR|REG))==VAR&&(p->q2.v->storage_class==AUTO||p->q2.v->storage_class==REGISTER)&&p->q2.v->offset>=0)
  719.                 localused=1;
  720.             if((p->z.flags&(VAR|REG))==VAR&&(p->z.v->storage_class==AUTO||p->z.v->storage_class==REGISTER)&&p->z.v->offset>=0)
  721.                 localused=1;
  722.             if(DEBUG&32&&localused==1) printf("localused=1\n");
  723.         }
  724.         if(c==ASSIGN&&isreg(q1)&&isreg(z)&&q1reg>=1&&q1reg<=8&&zreg>=1&&zreg<=8){
  725.         /*  fuer (ax)+  */
  726.             int i;
  727.             clear_am(q1reg);
  728.             for(i=1;i<=8;i++)
  729.                 if(am_base[i]==zreg||am_base[i]==q1reg) clear_am(i);
  730.             clear_am(zreg);am_base[zreg]=q1reg;am_dreg_ic[zreg]=p;
  731.             if(DEBUG&32) printf("move %s,%s found\n",regnames[q1reg],regnames[zreg]);
  732.             continue;
  733.         }
  734.         if(c==MULT&&g_flags_val[0].l>=68020&&(p->q2.flags&KONST)&&isreg(z)&&zreg>=9&&zreg<=16){
  735.         /*  dx=a*const, fuer Skalierung    */
  736.             int dreg=zreg-8;
  737.             if(dreg<1||dreg>8) ierror(0);
  738.             if(q1reg>=1&&q1reg<=16){
  739.                 if(isreg(q1)&&(q1reg>8||am_use[q1reg]!=p)) clear_am(q1reg);
  740.                 if((p->q1.flags&DREFOBJ)&&q1reg<=8&&am_use[q1reg]) clear_am(q1reg);
  741.             }
  742.             if(DEBUG&32) printf("mult x,const->dreg found\n");
  743.             if(am_skal[dreg]) {clear_am(zreg);continue;}
  744.             eval_const(&p->q2.val,p->typf);
  745.             am_skal[dreg]=zl2l(vlong);
  746.             if(am_skal[dreg]!=2&&am_skal[dreg]!=4&&am_skal[dreg]!=8)
  747.                 {clear_am(zreg);continue;}
  748.             am_shiftdreg[dreg]=p;
  749.             if(isreg(q1)&&q1reg>=9&&q1reg<=16) am_dbase[dreg]=q1reg; else am_dbase[dreg]=zreg;
  750.             if(DEBUG&32) printf("is usable\n");
  751.             continue;
  752.         }
  753.         if((c==ADD||c==SUB)&&(p->q2.flags&KONST)&&zreg>=1&&zreg<=8&&isreg(z)){
  754.         /*  add ax,#const,ax->az Test auf d8/16 fehlt noch (nicht mehr) */
  755.             long l;
  756.             if(zreg<1||zreg>8) ierror(0);
  757.             eval_const(&p->q2.val,p->typf);
  758.             l=zl2l(vlong);
  759.             if(c==SUB) l=-l;
  760.             if(q1reg==zreg&&am_use[zreg]&&(l==1||l==2||l==4)){
  761.                 if(l==msizetab[am_use[zreg]->typf&NQ]){
  762.                     struct IC *op=am_use[zreg];
  763.                     struct obj *o=0;
  764.                     if(DEBUG&32){ printf("found postincrement:\n");pric2(stdout,op);pric2(stdout,p);}
  765.                     if((op->q1.flags&(REG|DREFOBJ))==(REG|DREFOBJ)&&op->q1.reg==zreg){
  766.                         if(DEBUG&32) printf("q1\n");
  767.                         o=&op->q1;
  768.                     }
  769.                     if((op->q2.flags&(REG|DREFOBJ))==(REG|DREFOBJ)&&op->q2.reg==zreg){
  770.                         if(DEBUG&32) printf("q2\n");
  771.                         if(o) continue; else o=&op->q2;
  772.                     }
  773.                     if((op->z.flags&(REG|DREFOBJ))==(REG|DREFOBJ)&&op->z.reg==zreg){
  774.                         if(DEBUG&32) printf("z\n");
  775.                         if(o) continue; else o=&op->z;
  776.                     }
  777.                     o->am=mymalloc(AMS);
  778.                     o->am->basereg=zreg;
  779.                     o->am->skal=-1;
  780.                     o->am->dist=0;
  781.                     o->am->dreg=0;
  782.                     p=p->prev;
  783.                     remove_IC(p->next);
  784.                     clear_am(zreg);continue;
  785.                 }
  786.             }
  787.             clear_am(q1reg);
  788.             if(am_dist[zreg]||am_inc[zreg]||am_use[zreg]) {clear_am(zreg);continue;} /* nur ein Offset */
  789.             if(isreg(q1)&&q1reg==zreg&&(l==1||l==2||l==4)){
  790.             /*  ax+=const, fuer (ax)+   */
  791.                 int i,f;
  792.                 for(f=0,i=1;i<=8;i++){
  793.                     if(am_base[i]==zreg&&!am_dreg[i]&&!am_dist[i]){
  794.                         if(f) ierror(0);
  795.                         am_inc[i]=l;am_dist_ic[i]=p;f=i;
  796.                         if(DEBUG&32) printf("inc %s found\n",regnames[i]);
  797.                     }
  798.                 }
  799.                 if(f) continue;
  800.             }
  801.             am_dist[zreg]=l;
  802.             if(DEBUG&32) printf("dist=%ld\n",am_dist[zreg]);
  803.             if(g_flags_val[0].l<68020){
  804.             /*  bei <68020 darf der Offset nur 16bit oder 8bit bei dreg sein */
  805.                 if((am_dreg[zreg]&&(am_dist[zreg]<-128||am_dist[zreg]>127))||am_dist[zreg]<-32768||am_dist[zreg]>32767)
  806.                     {clear_am(zreg);continue;}
  807.             }
  808.             am_dist_ic[zreg]=p;
  809.             if(am_base[zreg]){
  810.                 if(q1reg!=zreg||!isreg(q1)) {clear_am(zreg);continue;}
  811.             }else{
  812.                 if(q1reg>=1&&q1reg<=8&&isreg(q1)) am_base[zreg]=q1reg; else am_base[zreg]=zreg;
  813.                 if(DEBUG&32) printf("%s potential base for %s\n",regnames[am_base[zreg]],regnames[zreg]);
  814.             }
  815.             if(DEBUG&32) printf("add #const,%s found\n",regnames[zreg]);
  816.             continue;
  817.         }
  818.         if(c==ADD&&q2reg>=9&&q2reg<=16&&isreg(q2)&&zreg>=1&&zreg<=8&&isreg(z)&&(p->q1.flags&(REG|DREFOBJ))!=(REG|DREFOBJ)){
  819.         /*  add ax,dy->az   */
  820.             int i;
  821.             if(zreg<1||zreg>8) ierror(0);
  822.             for(i=1;i<=8;i++)
  823.                 if(am_dreg[i]==q2reg){ clear_am(q2reg);clear_am(i);}
  824.             clear_am(q1reg);
  825.             if(am_dreg[zreg]||am_inc[zreg]||am_use[zreg]) {clear_am(zreg);continue;} /* nur ein Regoffset */
  826.             if(g_flags_val[0].l<68020&&(am_dist[zreg]<-128||am_dist[zreg]>127))
  827.                 {clear_am(zreg);continue;} /* bei <68020 nur 8bit Offset */
  828.             am_dreg[zreg]=q2reg;
  829.             if((p->typf&NQ)==SHORT) am_dreg[zreg]|=128; /* dx.w statt dx.l */
  830.             am_dreg_ic[zreg]=p;
  831.             if(am_base[zreg]){
  832.                 if(q1reg!=zreg||!isreg(q1)) {clear_am(zreg);continue;}
  833.             }else{
  834.                 if(q1reg>=1&&q1reg<=8&&isreg(q1)) am_base[zreg]=q1reg; else am_base[zreg]=zreg;
  835.             }
  836.             if(DEBUG&32) printf("add %s,%s found\n",regnames[q2reg],regnames[zreg]);
  837.             continue;
  838.         }
  839.         if(c==FREEREG){
  840.         /*  wir koennen den Modus tatsaechlich benutzen */
  841.             struct AddressingMode *am;struct IC *p1,*p2;int dreg,i;
  842.             if(DEBUG&32) printf("freereg %s found\n",regnames[p->q1.reg]);
  843.             if(q1reg>=9&&q1reg<=16) {am_freedreg[q1reg-8]=p;if(DEBUG&32) printf("freedreg[%d]=%lx\n",q1reg-8,(long)p);}
  844.             if(q1reg>8) continue;
  845.             if(DEBUG&32) printf("use=%p,base=%p,dist=%p,dreg=%p\n",(void*)am_use[q1reg],(void*)am_base[q1reg],(void*)am_dist[q1reg],(void*)am_dreg[q1reg]);
  846.             for(i=1;i<=8;i++) if(am_base[i]==q1reg) clear_am(i);
  847.             if(!am_use[q1reg]||!am_base[q1reg]) continue;
  848.             if(!am_dist[q1reg]&&!am_dreg[q1reg]&&!am_inc[q1reg]) continue;
  849.             p1=am_dist_ic[q1reg];p2=am_dreg_ic[q1reg];
  850.             if(DEBUG&32){
  851.                 printf("could really use %s\n",regnames[q1reg]);
  852.                 if(p1) pric2(stdout,p1);
  853.                 if(p2) pric2(stdout,p2);
  854.             }
  855.             if(am_base[q1reg]==q1reg){
  856.                 if(p1) {p1->q2.flags=0;p1->code=ASSIGN;p1->q2.val.vlong=l2zl(4L);p1->typf=POINTER;}
  857.                 if(p2) {p2->q2.flags=0;p2->code=ASSIGN;p2->q2.val.vlong=l2zl(4L);p2->typf=POINTER;}
  858.             }else{
  859.                 if(p1) remove_IC(p1);
  860.                 if(p2) remove_IC(p2);
  861.             }
  862.             dreg=(am_dreg[q1reg]&127)-8;
  863.             am=mymalloc(AMS);
  864.             am->skal=0;
  865.             am->basereg=am_base[q1reg];
  866.             am->dist=am_dist[q1reg];
  867.             am->dreg=am_dreg[q1reg];
  868.             if(am_inc[q1reg]) am->skal=-1;
  869.             if(dreg>0){
  870.                 /*  bei (d,ax,dy) das freereg dy nach hinten verschieben    */
  871.                 if(dreg<1||dreg>8) ierror(0);
  872.                 if(p1=am_freedreg[dreg]){
  873.                     if(DEBUG&32){
  874.                         printf("freereg %s moved from %p to %p\n",regnames[dreg+8],(void*)p1,(void*)p);
  875.                         pric2(stdout,p1);
  876.                     }
  877.                     if(p1->code!=FREEREG){ierror(0);printf("freereg[%d]=%p\n",dreg,(void*)p1);continue;}
  878.                     if(!p1->next) {ierror(0);continue;}
  879.                     if(!p1->prev) {ierror(0);continue;}
  880.                     p1->prev->next=p1->next;
  881.                     p1->next->prev=p1->prev;
  882.                     p1->next=p->next;
  883.                     p1->prev=p;
  884.                     if(p->next) p->next->prev=p1;
  885.                     p->next=p1;
  886.                 }
  887.                 if(am_skal[dreg]){
  888.                 /*  Skalierung bearbeiten   */
  889.                     if(p1){
  890.                         am->skal=am_skal[dreg];
  891.                         am->dreg=am_dbase[dreg];
  892.                         p1=am_shiftdreg[dreg];
  893.                         if(DEBUG&32) pric2(stdout,p1);
  894.                         if(am_dbase[dreg]==dreg+8){
  895.                             p1->code=ASSIGN;p1->q2.flags=0;p1->q2.val.vlong=sizetab[p1->typf&NQ];
  896.                         }else remove_IC(p1);
  897.                     }
  898.                     clear_am(dreg+8);
  899.                 }
  900.             }
  901.             /*  das hier duerfte unnoetig sein, da die Adressierungsart in  */
  902.             /*  einem IC eigentlich hoechstens einmal vorkommen darf        */
  903.             if(q1reg<0||q1reg>8) ierror(0);
  904.             p1=am_use[q1reg];
  905.             if(DEBUG&32) pric2(stdout,p1);
  906.             if(p1->code==PUSH&&p1->q1.reg==q1reg&&((p1->q1.flags&(DREFOBJ|REG))==(REG))){
  907.                 p1->q1.am=mymalloc(AMS);
  908.                 memcpy(p1->q1.am,am,AMS);
  909.                 p->q1.val.vlong=l2zl(0L);
  910.                 p1->code=PEA;
  911.                 if(DEBUG&32) printf("q1 patched\n");
  912.             }
  913.             if(p1->q1.reg==q1reg&&((p1->q1.flags&(DREFOBJ|REG))==(DREFOBJ|REG))){
  914.                 p1->q1.am=mymalloc(AMS);
  915.                 memcpy(p1->q1.am,am,AMS);
  916.                 p1->q1.val.vlong=l2zl(0L);
  917.                 if(DEBUG&32) printf("q1 patched\n");
  918.             }
  919.             if(p1->q2.reg==q1reg&&((p1->q2.flags&(DREFOBJ|REG))==(DREFOBJ|REG))){
  920.                 p1->q2.am=mymalloc(AMS);
  921.                 memcpy(p1->q2.am,am,AMS);
  922.                 p1->q2.val.vlong=l2zl(0L);
  923.                 if(DEBUG&32) printf("q2 patched\n");
  924.             }
  925.             if(p1->z.reg==q1reg&&((p1->z.flags&(DREFOBJ|REG))==(DREFOBJ|REG))){
  926.                 p1->z.am=mymalloc(AMS);
  927.                 memcpy(p1->z.am,am,AMS);
  928.                 p1->z.val.vlong=l2zl(0L);
  929.                 if(DEBUG&32) printf("z patched\n");
  930.             }
  931.             free(am);count++;
  932.             clear_am(q1reg);
  933.             continue;
  934.         }
  935.         if(c>=LABEL&&c<=BRA){
  936.             int i;      /*  ueber basic blocks hinweg unsicher  */
  937.             for(i=1;i<=16;i++) clear_am(i);
  938.             continue;
  939.         }
  940.         /*  Wenn Libraryaufrufe noetig sind (floating point ohne FPU oder   */
  941.         /*  32bit mul/div/mod ohne 020+) keine Addressierungsarten nutzen   */
  942.         if(g_flags_val[1].l<68000&&(p->typf==FLOAT||p->typf==DOUBLE||c==CONVFLOAT||c==CONVDOUBLE)){
  943.             int i;
  944.             for(i=1;i<=16;i++) clear_am(i);
  945.             continue;
  946.         }
  947.         if(g_flags_val[0].l<68020&&(c==DIV||c==MOD)){
  948.             int i;
  949.             for(i=1;i<=16;i++) clear_am(i);
  950.             continue;
  951.         }
  952.         if(c==PUSH&&((p->q1.flags&(DREFOBJ|REG))==REG&&q1reg<=8&&(am_inc[q1reg]||am_dist[q1reg]||am_dreg[q1reg]))){
  953.             if(q1reg<1||q1reg>8) ierror(0);
  954.             if(am_inc[q1reg]&&am_inc[q1reg]!=msizetab[p->typf&NQ]) clear_am(q1reg); else am_use[q1reg]=p;
  955.             if(DEBUG&32) printf("use of %s found\n",regnames[q1reg]);
  956.             continue;
  957.         }
  958.         if(((p->q1.flags&(DREFOBJ|REG))==(DREFOBJ|REG)&&q1reg<=8)){
  959.             if(q1reg<1||q1reg>8) ierror(0);
  960.             if(am_use[q1reg]&&(am_use[q1reg]!=p||am_inc[q1reg])) clear_am(q1reg); else am_use[q1reg]=p;
  961.             if(am_inc[q1reg]&&am_inc[q1reg]!=sizetab[p->typf&NQ]) clear_am(q1reg);
  962.             if(DEBUG&32) printf("use of %s found\n",regnames[q1reg]);
  963.         }
  964.         if(((p->q2.flags&(DREFOBJ|REG))==(DREFOBJ|REG)&&q2reg<=8)){
  965.             if(q2reg<1||q2reg>8) ierror(0);
  966.             if(am_use[q2reg]&&(am_use[q2reg]!=p||am_inc[q2reg])) clear_am(q2reg); else am_use[q2reg]=p;
  967.             if(am_inc[q2reg]&&am_inc[q2reg]!=sizetab[p->typf&NQ]) clear_am(q2reg);
  968.             if(DEBUG&32) printf("use of %s found\n",regnames[q2reg]);
  969.         }
  970.         if(((p->z.flags&(DREFOBJ|REG))==(DREFOBJ|REG)&&zreg<=8)){
  971.             if(zreg<1||zreg>8) ierror(0);
  972.             if(am_use[zreg]&&(am_use[zreg]!=p||am_inc[zreg])) clear_am(zreg); else am_use[zreg]=p;
  973.             if(am_inc[zreg]&&am_inc[zreg]!=sizetab[p->typf&NQ]) clear_am(zreg);
  974.             if(DEBUG&32) printf("use of %s found\n",regnames[zreg]);
  975.         }
  976.         if(c==ALLOCREG){
  977.         /*  allocreg zaehlt als zerstoerung von reg */
  978.             p->z.flags=REG;
  979.             p->z.reg=zreg=q1reg;
  980.         }
  981.         if(q1reg>=1&&q1reg<=16&&isreg(q1)&&(q1reg>8||am_use[q1reg]!=p)) clear_am(q1reg);
  982.         if(q2reg>=1&&q2reg<=16&&isreg(q2)&&(q2reg>8||am_use[q2reg]!=p)) clear_am(q2reg);
  983.         if(zreg>=1&&zreg<=16&&isreg(z)) clear_am(zreg);
  984.         if(isreg(z)&&zreg<=16){
  985.         /*  schauen, ob eines der Register ueberschrieben wird  */
  986.         /*  wohl noch sehr langsam                              */
  987.             int i;
  988.             for(i=1;i<=8;i++)
  989.                 if(!am_use[i]&&(am_base[i]==zreg||(am_dreg[i]&127)==zreg)) clear_am(i);
  990.         }
  991.         if(c==ALLOCREG) p->z.flags=0;
  992.     }
  993.     if(DEBUG&1) printf("%d addressingmodes used, localused=%d\n",count,localused);
  994.     return(localused);
  995. }
  996. static int alignment(struct obj *o)
  997. /*  versucht rauszufinden, wie ein Objekt alignet ist   */
  998. {
  999.     /*  wenn es keine Variable ist, kann man nichts aussagen    */
  1000.     long os;
  1001.     if((o->flags&(DREFOBJ|VAR))!=VAR||o->am) return(0);
  1002.     if(!o->v) ierror(0);
  1003.     os=zl2l(o->val.vlong);
  1004.     if(o->v->storage_class==AUTO||o->v->storage_class==REGISTER){
  1005.         if(!(g_flags[8]&USEDFLAG)){
  1006.             if(!zlleq(l2zl(0L),o->v->offset)) os=os+loff-zl2l(o->v->offset);
  1007.              else              os=os+zl2l(o->v->offset);
  1008.         }else{
  1009.             if(!zlleq(l2zl(0L),o->v->offset)) os=os-zl2l(o->v->offset);
  1010.              else              os=os-(zl2l(o->v->offset)+zl2l(szof(o->v->vtyp)));
  1011.         }
  1012.     }
  1013.     return(os&3);
  1014. }
  1015. static void assign(FILE *f,struct IC *p,struct obj *q,struct obj *z,int c,long size,int t)
  1016. /*  Generiert Code fuer Zuweisungen und PUSH.   */
  1017. {
  1018.     /*  auch noch sehr fpu-spezifisch   */
  1019.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE){
  1020.         if(q&&(q->flags&KONST)){
  1021.             if(z&&(z->flags&(DREFOBJ|REG))==REG){
  1022.             /*  FP-Konstante->Register (muss immer reinpassen)  */
  1023.                 if(z->reg>=17) fprintf(f,"\tfmove"); else fprintf(f,"\tmove");
  1024.                 fprintf(f,".%c\t",x_t[t&NQ]);probj2(f,q,t);
  1025.                 fprintf(f,",%s\n",regnames[z->reg]);
  1026.             }else{
  1027.             /*  FP-Konstante->Speicher (evtl. auf zweimal)  */
  1028.                 int m;unsigned char *ip=(unsigned char *)&q->val.vfloat; /* nicht sehr schoen  */
  1029.                 char *s;
  1030.                 if(gas) s="0x"; else s="$";
  1031.                 if(c==PUSH&&t==DOUBLE){
  1032.                     fprintf(f,"\tmove.l\t#%s%02x%02x%02x%02x,-(a7)\n",s,ip[4],ip[5],ip[6],ip[7]);
  1033.                     stackoffset-=4;
  1034.                 }
  1035.                 fprintf(f,"\tmove.l\t#%s%02x%02x%02x%02x,",s,ip[0],ip[1],ip[2],ip[3]);
  1036.                 if(c==ASSIGN) probj2(f,z,t); else {fprintf(f,"-(a7)");stackoffset-=4;}
  1037.                 fprintf(f,"\n");
  1038.                 if(t!=DOUBLE||c==PUSH) return;
  1039.                 m=0;
  1040.                 if(z&&z->flags®){
  1041.                     m=1;z->flags|=D16OFF;
  1042.                     z->val.vlong=l2zl(0L);
  1043.                 }
  1044.                 vlong=l2zl(4L);
  1045.                 z->val.vlong=zladd(z->val.vlong,vlong);
  1046.                 fprintf(f,"\tmove.l\t#%s%02x%02x%02x%02x,",s,ip[4],ip[5],ip[6],ip[7]);
  1047.                 probj2(f,z,t);
  1048.                 fprintf(f,"\n");
  1049.                 if(m){
  1050.                     z->flags&=~D16OFF;vlong=l2zl(4L);
  1051.                     z->val.vlong=zlsub(z->val.vlong,vlong);
  1052.                 }
  1053.             }
  1054.             return;
  1055.         }
  1056.         if((q&&(q->flags®)&&q->reg>=17)||(z&&(z->flags®)&&z->reg>=17)){
  1057.             if(c==ASSIGN&&q->reg==z->reg) return;
  1058.             if(c==ASSIGN){ move(f,q,0,z,0,t);return;}
  1059.             fprintf(f,"\tfmove.%c\t",x_t[t&NQ]);
  1060.             probj2(f,q,t);
  1061.             fprintf(f,",");
  1062.             if(c==PUSH) {fprintf(f,"-(a7)");stackoffset-=size;} else probj2(f,z,t);
  1063.             fprintf(f,"\n");return;
  1064.         }
  1065.     }
  1066.     if(size<=4&&(t&NQ)!=ARRAY&&((t&NQ)!=CHAR||size==1)){
  1067.         if((t&NQ)==STRUCT||(t&NQ)==UNION){
  1068.             if(size==2) t=SHORT; else t=LONG;
  1069.         }
  1070.         if(c==ASSIGN){move(f,q,0,z,0,t);return;}
  1071.         /*  Sonderfall pea  */
  1072.         if((q->flags&VARADR)&&c==PUSH){
  1073.             fprintf(f,"\tpea\t");
  1074.             q->flags&=~VARADR; probj2(f,q,t); q->flags|=VARADR;
  1075.             fprintf(f,"\n"); stackoffset-=4;return;
  1076.         }
  1077.         fprintf(f,"\tmove.%c\t",x_s[size]);
  1078.         probj2(f,q,t);
  1079.         fprintf(f,",");
  1080.         if(c==PUSH) {fprintf(f,"-(a7)");stackoffset-=size;} else probj2(f,z,t);
  1081.         fprintf(f,"\n");return;
  1082.     }else{
  1083.         int a1,a2,qreg,zreg,dreg,s=size,loops,scratch=0;char *cpstr;
  1084.         struct IC *m;
  1085.         for(m=p->next;m&&m->code==FREEREG;m=m->next){
  1086.             if(q&&m->q1.reg==q->reg) scratch|=1;
  1087.             if(z&&m->q1.reg==z->reg) scratch|=2;
  1088.         }
  1089.         if(c==PUSH) cpstr="\tmove.%c\t-(%s),-(%s)\n"; else cpstr="\tmove.%c\t(%s)+,(%s)+\n";
  1090.         if((c==PUSH||(scratch&1))&&(q->flags&(REG|DREFOBJ))==(REG|DREFOBJ)&&q->reg>=1&&q->reg<=8&&!q->am){
  1091.             qreg=q->reg;
  1092.             if(c==PUSH)
  1093.                 fprintf(f,"\tadd%s.%s\t#%ld,%s\n",quick[s<=8],strshort[s<=32767],(long)s,regnames[q->reg]);
  1094.         }else{
  1095.             if(c!=ASSIGN&&!regavailable(0)) qreg=pget_reg(f,0,p);
  1096.                 else qreg=get_reg(f,0,p);
  1097.             if(c==PUSH){q->flags|=D16OFF; q->val.vlong=zladd(q->val.vlong,l2zl((long)s));}
  1098.             fprintf(f,"\tlea\t");probj2(f,q,POINTER);
  1099.             if(c==PUSH) q->val.vlong=zlsub(q->val.vlong,l2zl((long)s));
  1100.             fprintf(f,",%s\n",regnames[qreg]);
  1101.         }
  1102.         if(c==PUSH){
  1103.             zreg=8;
  1104. /*            fprintf(f,"\tadd%s.%s\t#%ld,%s\n",quick[s<=8],strshort[s<=32767],(long)s,regnames[qreg]);*/
  1105.         }else{
  1106.             if((scratch&2)&&(z->flags&(REG|DREFOBJ))==(REG|DREFOBJ)&&z->reg>=1&&z->reg<=8&&!z->am){
  1107.                 zreg=z->reg;
  1108.             }else{
  1109.                 zreg=get_reg(f,0,p);
  1110.                 fprintf(f,"\tlea\t");probj2(f,z,POINTER);
  1111.                 fprintf(f,",%s\n",regnames[zreg]);
  1112.             }
  1113.         }
  1114.         a1=alignment(q);
  1115.         if(c!=PUSH)  a2=alignment(z); else a2=0;
  1116.         /*  wenn Typ==CHAR, dann ist das ein inline_memcpy und wir nehmen   */
  1117.         /*  das unguenstigste Alignment an                                  */
  1118.         if((t&NQ)==CHAR){ a1=1;a2=2;}
  1119.  
  1120.         if((a1&1)&&(a2&1)){fprintf(f,cpstr,'b',regnames[qreg],regnames[zreg]);s--;a1&=~1;a2&=~1;}
  1121.         if((a1&2)&&(a2&2)){fprintf(f,cpstr,'w',regnames[qreg],regnames[zreg]);s-=2;a1&=~2;a2&=~2;}
  1122.         if(!(a1&1)&&!(a2&1)) loops=s/16-1; else loops=s/4-1;
  1123.         if(loops>0){
  1124.             if(c!=ASSIGN&&!regavailable(1)) dreg=pget_reg(f,0,p);
  1125.                 else dreg=get_reg(f,1,p);
  1126.             fprintf(f,"\tmove%s.l\t#%d,%s\nl%d:\n",quick[loops>=-128&&loops<=127],loops,regnames[dreg],++label);
  1127.         }
  1128.         if(loops>=0){
  1129.             int t;
  1130.             if(!(a1&1)&&!(a2&1)) t='l'; else t='b';
  1131.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1132.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1133.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1134.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1135.         }
  1136.         if(loops>0){
  1137.             if(loops<=32767&&loops>=-32768){
  1138.                 fprintf(f,"\tdbra\t%s,l%d\n",regnames[dreg],label);
  1139.             }else{
  1140.                 fprintf(f,"\tsubq.l\t#1,%s\n\tbge\tl%d\n",regnames[dreg],label);
  1141.             }
  1142.         }
  1143.         if(!(a1&1)&&!(a2&1)){
  1144.             if(s&8){
  1145.                 fprintf(f,cpstr,'l',regnames[qreg],regnames[zreg]);
  1146.                 fprintf(f,cpstr,'l',regnames[qreg],regnames[zreg]);
  1147.             }
  1148.             if(s&4) fprintf(f,cpstr,'l',regnames[qreg],regnames[zreg]);
  1149.             if(s&2) fprintf(f,cpstr,'w',regnames[qreg],regnames[zreg]);
  1150.             if(s&1) fprintf(f,cpstr,'b',regnames[qreg],regnames[zreg]);
  1151.         }else{
  1152.             s&=3;
  1153.             while(s){fprintf(f,cpstr,'b',regnames[qreg],regnames[zreg]);s--;}
  1154.         }
  1155.         if(c==PUSH) stackoffset-=size;
  1156.     }
  1157.     return;
  1158. }
  1159. static int store_saveregs;
  1160. static void saveregs(FILE *f,struct IC *p)
  1161. {
  1162.     int dontsave;
  1163.     store_saveregs=0;
  1164.     if((p->z.flags&(REG|DREFOBJ))==REG) dontsave=p->z.reg; else dontsave=0;
  1165.     if(dontsave!= 9&®s[ 9]) {fprintf(f,"\tmove.l\td0,-(a7)\n");stackoffset-=4;store_saveregs|=1;}
  1166.     if(dontsave!=10&®s[10]) {fprintf(f,"\tmove.l\td1,-(a7)\n");stackoffset-=4;store_saveregs|=2;}
  1167.     if(dontsave!= 1&®s[ 1]) {fprintf(f,"\tmove.l\ta0,-(a7)\n");stackoffset-=4;store_saveregs|=4;}
  1168.     if(dontsave!= 2&®s[ 2]) {fprintf(f,"\tmove.l\ta1,-(a7)\n");stackoffset-=4;store_saveregs|=8;}
  1169. }
  1170. static void restoreregsa(FILE *f,struct IC *p)
  1171. {
  1172.     if(store_saveregs&8) {fprintf(f,"\tmove.l\t(a7)+,a1\n");stackoffset+=4;}
  1173.     if(store_saveregs&4) {fprintf(f,"\tmove.l\t(a7)+,a0\n");stackoffset+=4;}
  1174. }
  1175. static void restoreregsd(FILE *f,struct IC *p)
  1176. {
  1177.     int dontsave;
  1178.     if((p->z.flags&(REG|DREFOBJ))==REG) dontsave=p->z.reg; else dontsave=0;
  1179.     if(dontsave!=10&&(store_saveregs&2)) {fprintf(f,"\tmovem.l\t(a7)+,d1\n");stackoffset+=4;}
  1180.     if(dontsave!=9 &&(store_saveregs&1)) {fprintf(f,"\tmovem.l\t(a7)+,d0\n");stackoffset+=4;}
  1181. }
  1182. static int is_const(struct Typ *t)
  1183. /*  tested, ob ein Typ konstant (und damit evtl. in der Code-Section) ist   */
  1184. {
  1185.     if(!(t->flags&(CONST|STRINGCONST))){
  1186.         do{
  1187.             if(t->flags&(CONST|STRINGCONST)) return(1);
  1188.             if((t->flags&NQ)!=ARRAY) return(0);
  1189.             t=t->next;
  1190.         }while(1);
  1191.     }else return(1);
  1192. }
  1193.  
  1194.  
  1195. /****************************************/
  1196. /*  End of private fata and functions.  */
  1197. /****************************************/
  1198.  
  1199.  
  1200.  
  1201. int init_cg(void)
  1202. /*  Does necessary initializations for the code-generator. Gets called  */
  1203. /*  once at the beginning and should return 0 in case of problems.      */
  1204. {
  1205.     int i;
  1206.     larray.size=l2zl(3L);
  1207.     /*  Initialize some values which cannot be statically initialized   */
  1208.     /*  because they are stored in the target's arithmetic.             */
  1209.     maxalign=l2zl(4L);
  1210.     char_bit=l2zl(8L);
  1211.     for(i=0;i<16;i++){
  1212.         sizetab[i]=l2zl(msizetab[i]);
  1213.         align[i]=l2zl(malign[i]);
  1214.     }
  1215.     for(i= 1;i<=16;i++) {regsize[i]=l2zl( 4L);regtype[i]=<yp;}
  1216.     for(i=17;i<=24;i++) {regsize[i]=l2zl(12L);regtype[i]=&larray;}
  1217.  
  1218.     /*  default CPU is 68000    */
  1219.     if(!(g_flags[0]&USEDFLAG)) g_flags_val[0].l=68000;
  1220.     /*  no FPU by default       */
  1221.     if(!(g_flags[1]&USEDFLAG)) g_flags_val[1].l=0;
  1222.     if(g_flags_val[1].l<68000) {x_t[FLOAT]='l';}
  1223.     if(g_flags[2]&USEDFLAG) regscratch[11]=1;
  1224.     if(g_flags[3]&USEDFLAG) regsa[5]=1;
  1225.     if(g_flags[15]&USEDFLAG) dbout=1;
  1226.     if(g_flags[11]&USEDFLAG){
  1227.         gas=1;
  1228.         codename="\t.text\n";
  1229.         bssname="";
  1230.         dataname="\t.data\n";
  1231.         if(g_flags[5]&USEDFLAG) regsa[5]=1;
  1232.     }else{
  1233.         codename="\tsection\t\"CODE\",code\n";
  1234.         if(g_flags[5]&USEDFLAG){
  1235.             /*  preparing small data    */
  1236.             regsa[5]=1;
  1237.             bssname= "\tsection\t\"__MERGED\",bss\n";
  1238.             dataname="\tsection\t\"__MERGED\",data\n";
  1239.         }else{
  1240.             bssname= "\tsection\t\"BSS\",bss\n";
  1241.             dataname="\tsection\t\"DATA\",data\n";
  1242.         }
  1243.     }
  1244.     /*  a5 can be used if no framepointer is used.  */
  1245.     if(!(g_flags[8]&USEDFLAG)) regsa[6]=0;
  1246.     if(DEBUG&1) printf("CPU=%ld FPU=%ld\n",g_flags_val[0].l,g_flags_val[1].l);
  1247.  
  1248.     /*  Initialize the min/max-settings. Note that the types of the     */
  1249.     /*  host system may be different from the target system and you may */
  1250.     /*  only use the smallest maximum values ANSI guarantees if you     */
  1251.     /*  want to be portable.                                            */
  1252.     /*  That's the reason for the subtraction in t_min[INT]. Long could */
  1253.     /*  be unable to represent -2147483648 on the host system.          */
  1254.     t_min[UNSIGNED|CHAR]=t_min[UNSIGNED|SHORT]=t_min[UNSIGNED|INT]=t_min[UNSIGNED|LONG]=l2zl(0L);
  1255.     t_min[CHAR]=l2zl(-128L);
  1256.     t_min[SHORT]=l2zl(-32768L);
  1257.     t_min[INT]=zlsub(l2zl(-2147483647L),l2zl(1L));
  1258.     t_min[LONG]=t_min[INT];
  1259.     t_max[CHAR]=ul2zul(127L);
  1260.     t_max[SHORT]=ul2zul(32767UL);
  1261.     t_max[INT]=ul2zul(2147483647UL);
  1262.     t_max[LONG]=t_max[INT];
  1263.     t_max[UNSIGNED|CHAR]=ul2zul(255UL);
  1264.     t_max[UNSIGNED|SHORT]=ul2zul(65535UL);
  1265.     t_max[UNSIGNED|INT]=ul2zul(4294967295UL);
  1266.     t_max[UNSIGNED|LONG]=t_max[UNSIGNED|INT];
  1267.  
  1268.     return(1);
  1269. }
  1270.  
  1271. int freturn(struct Typ *t)
  1272. /*  Returns the register in which variables of type t are returned. */
  1273. /*  If the value cannot be returned in a register returns 0.        */
  1274. {
  1275.     long l;int tu=t->flags&NQ;
  1276.     if(tu==FLOAT){
  1277.         if(g_flags_val[1].l>=68000&&!(g_flags[13]&USEDFLAG))
  1278.             return(17);
  1279.         else
  1280.             return(9);
  1281.     }
  1282.     if(tu==DOUBLE){
  1283.         if(g_flags_val[1].l>=68000&&!(g_flags[13]&USEDFLAG)){
  1284.             return(17);
  1285.         }else{
  1286.             if(g_flags[14]&USEDFLAG) return(0);
  1287.             return(9);
  1288.         }
  1289.     }
  1290.     if(tu==STRUCT||tu==UNION){
  1291.         if(!(g_flags[14]&USEDFLAG)){
  1292.             l=zl2l(szof(t));
  1293.             if(l==4||l==8||l==12||l==16) return(9);
  1294.         }
  1295.         return(0);
  1296.     }
  1297.     if(zlleq(szof(t),l2zl(4L))) return(9); else return(0);
  1298. }
  1299.  
  1300. int regok(int r,int t,int mode)
  1301. /*  Returns 0 if register r cannot store variables of   */
  1302. /*  type t. If t==POINTER and mode!=0 then it returns   */
  1303. /*  non-zero only if the register can store a pointer   */
  1304. /*  and dereference a pointer to mode.                  */
  1305. {
  1306.     if(r==0) return(0);
  1307.     t&=NQ;
  1308.     if(t==FLOAT||t==DOUBLE){
  1309.         if(g_flags_val[1].l>=68000){
  1310.             if(r>=17&&r<=24) return(1); else return(0);
  1311.         }else{
  1312.             if(t==FLOAT&&r>=9&&r<=16) return(1); else return(0);
  1313.         }
  1314.     }
  1315.     if(t==POINTER&&mode==0&&r>=9&&r<=16) return(1);
  1316.     if(t==POINTER&&r>=1&&r<=8) return(1);
  1317.     if(t>=CHAR&&t<=LONG&&r>=9&&r<=16) return(1);
  1318.     return(0);
  1319. }
  1320.  
  1321. int dangerous_IC(struct IC *p)
  1322. /*  Returns zero if the IC p can be safely executed     */
  1323. /*  without danger of exceptions or similar things.     */
  1324. /*  vbcc may generate code in which non-dangerous ICs   */
  1325. /*  are sometimes executed although control-flow may    */
  1326. /*  never reach them (mainly when moving computations   */
  1327. /*  out of loops).                                      */
  1328. /*  Typical ICs that generate exceptions on some        */
  1329. /*  machines are:                                       */
  1330. /*      - accesses via pointers                         */
  1331. /*      - division/modulo                               */
  1332. /*      - overflow on signed integer/floats             */
  1333. {
  1334.     int c=p->code;
  1335.     if((p->q1.flags&DREFOBJ)||(p->q2.flags&DREFOBJ)||(p->z.flags&DREFOBJ))
  1336.         return(0);
  1337.     if((c==DIV||c==MOD)&&!(p->q2.flags&KONST)) return(1);
  1338.     return(0);
  1339. }
  1340.  
  1341. int must_convert(np p,int t)
  1342. /*  Returns zero if code for converting np to type t    */
  1343. /*  can be omitted.                                     */
  1344. {
  1345.     int o=p->ntyp->flags,op=o&NQ,tp=t&NQ;
  1346.     /*  All pointers have the same representation.  */
  1347.     if(tp==POINTER&&op==POINTER) return(0);
  1348.     /*  Pointer and int/long as well   */
  1349. /*    if(tp==POINTER&&(op==INT||op==LONG)) return(0);
  1350.     if(op==POINTER&&(tp==INT||tp==LONG)) return(0);*/
  1351.     /*  Signed und Unsigned integers with the same size, too.  */
  1352.     if((t&UNSIGNED)&&(o&UNSIGNED)&&zleqto(sizetab[tp],sizetab[op])) return(0);
  1353.     /*  int==long   */
  1354.     if((tp==INT&&op==LONG)||(tp==LONG&&op==INT)) return(0);
  1355.  
  1356.     /*    if((tp==FLOAT||tp==DOUBLE)&&(op==FLOAT||op==DOUBLE)&&(p->o.flags®)&&p->o.reg>=17&&p->o.reg<=24)
  1357.         return(0);*/
  1358.  
  1359.     return(1);
  1360. }
  1361.  
  1362. void gen_ds(FILE *f,zlong size,struct Typ *t)
  1363. /*  This function has to create <size> bytes of storage */
  1364. /*  initialized with zero.                              */
  1365. {
  1366.     if(gas){
  1367.         if(newobj) fprintf(f,"%ld\n",zl2l(size));
  1368.             else   fprintf(f,"\t.space\t%ld\n",zl2l(size));
  1369.         newobj=0;
  1370.     }else{
  1371.         if(section!=BSS&&newobj){fprintf(f,bssname);section=BSS;}
  1372.         fprintf(f,"\tds.b\t%ld\n",zl2l(size));newobj=0;
  1373.     }
  1374. }
  1375.  
  1376. void gen_align(FILE *f,zlong align)
  1377. /*  This function has to make sure the next data is     */
  1378. /*  aligned to multiples of <align> bytes.              */
  1379. {
  1380.     if(align>1){
  1381.         if(gas){
  1382.             fprintf(f,"\t.align\t4\n");
  1383.         }else{
  1384.             fprintf(f,"\tcnop\t0,4\n");
  1385.         }
  1386.     }
  1387. }
  1388. void gen_var_head(FILE *f,struct Var *v)
  1389. /*  This function has to create the head of a variable  */
  1390. /*  definition, i.e. the label and information for      */
  1391. /*  linkage etc.                                        */
  1392. {
  1393.     int constflag;
  1394.     if(v->clist) constflag=is_const(v->vtyp);
  1395.     if(v->storage_class==STATIC){
  1396.         if((v->vtyp->flags&NQ)==FUNKT) return;
  1397.         if(v->clist&&(!constflag||(g_flags[7]&USEDFLAG))&§ion!=DATA){fprintf(f,dataname);section=DATA;}
  1398.         if(v->clist&&constflag&&!(g_flags[7]&USEDFLAG)&§ion!=CODE){fprintf(f,codename);section=CODE;}
  1399.         if(!v->clist&§ion!=BSS){fprintf(f,bssname);section=BSS;}
  1400.         if(gas){
  1401.             if(section!=BSS) fprintf(f,"\t.align\t4\nl%ld:\n",zl2l(v->offset));
  1402.                 else fprintf(f,"\t.lcomm\tl%ld,",zl2l(v->offset));
  1403.         }else{
  1404.             fprintf(f,"\tcnop\t0,4\nl%ld\n",zl2l(v->offset));
  1405.         }
  1406.         newobj=1;
  1407.     }
  1408.     if(v->storage_class==EXTERN){
  1409.         if(gas){
  1410.             fprintf(f,"\t.global\t_%s\n",v->identifier);
  1411.         }else{
  1412.             fprintf(f,"\tpublic\t_%s\n",v->identifier);
  1413.         }
  1414.         if(v->flags&(DEFINED|TENTATIVE)){
  1415.             if(v->clist&&(!constflag||(g_flags[7]&USEDFLAG))&§ion!=DATA){fprintf(f,dataname);section=DATA;}
  1416.             if(v->clist&&constflag&&!(g_flags[7]&USEDFLAG)&§ion!=CODE){fprintf(f,codename);section=CODE;}
  1417.             if(!v->clist&§ion!=BSS){fprintf(f,bssname);section=BSS;}
  1418.             if(gas){
  1419.                 if(section!=BSS) fprintf(f,"\t.align\t4\n_%s:\n",v->identifier);
  1420.                     else fprintf(f,"\t.comm\t_%s,",v->identifier);
  1421.             }else{
  1422.                 fprintf(f,"\tcnop\t0,4\n_%s\n",v->identifier);
  1423.             }
  1424.             newobj=1;
  1425.         }
  1426.     }
  1427. }
  1428. void gen_dc(FILE *f,int t,struct const_list *p)
  1429. /*  This function has to create static storage          */
  1430. /*  initialized with const-list p.                      */
  1431. {
  1432.     char s;
  1433.     if(!p){ierror(0);return;}
  1434. /*    if(section!=DATA){fprintf(f,dataname);section=DATA;}*/
  1435.     if((t&NQ)==FLOAT||(t&NQ)==DOUBLE) s='l'; else s=x_t[t&NQ];
  1436.     if(gas){
  1437.         char *str;
  1438.         if(s=='b') str="\t.byte\t";
  1439.         else if(s=='w') str="\t.short\t";
  1440.         else if(s=='l') str="\t.long\t";
  1441.         else ierror(0);
  1442.         fprintf(f,"%s",str);
  1443.     }else{
  1444.         fprintf(f,"\tdc.%c\t",s);
  1445.     }
  1446.     if(!p->tree){
  1447.         if((t&NQ)==FLOAT||(t&NQ)==DOUBLE){
  1448.         /*  auch wieder nicht sehr schoen und IEEE noetig   */
  1449.             unsigned char *ip;char *s;
  1450.             ip=(unsigned char *)&p->val.vdouble;
  1451.             if(gas) s="0x"; else s="$";
  1452.             fprintf(f,"%s%02x%02x%02x%02x",s,ip[0],ip[1],ip[2],ip[3]);
  1453.             if((t&NQ)==DOUBLE){
  1454.                 fprintf(f,",%s%02x%02x%02x%02x",s,ip[4],ip[5],ip[6],ip[7]);
  1455.             }
  1456.         }else{
  1457.             printval(f,&p->val,t&NU,0);
  1458.         }
  1459.     }else{
  1460.         int m,m2;
  1461.         p->tree->o.am=0;
  1462.         m=p->tree->o.flags;
  1463.         p->tree->o.flags&=~VARADR;
  1464.         m2=g_flags[5];
  1465.         g_flags[5]&=~USEDFLAG;
  1466.         probj2(f,&p->tree->o,t&NU);
  1467.         p->tree->o.flags=m;
  1468.         g_flags[5]=m2;
  1469.     }
  1470.     fprintf(f,"\n");newobj=0;
  1471. }
  1472.  
  1473. /*  The main code-generation routine.                   */
  1474. /*  f is the stream the code should be written to.      */
  1475. /*  p is a pointer to a doubly linked list of ICs       */
  1476. /*  containing the function body to generate code for.  */
  1477. /*  v is a pointer to the function.                     */
  1478. /*  offset is the size of the stackframe the function   */
  1479. /*  needs for local variables.                          */
  1480.  
  1481. void gen_code(FILE *f,struct IC *p,struct Var *v,zlong offset)
  1482. {
  1483.     int c,t,comptyp;char fp[2]="\0\0";
  1484.     int act_line=0;char *act_file=0;
  1485.     if(DEBUG&1) printf("gen_code()\n");
  1486.     for(c=1;c<=MAXR;c++) regs[c]=regsa[c];
  1487.     if(!(g_flags[9]&USEDFLAG)){
  1488.     /*  Adressierungsarten benutzen */
  1489.         if(!addressing()) offset=l2zl(0L);
  1490.     }
  1491.     if(dbout){
  1492.         if(!gas){
  1493.             act_line=fline;
  1494.             fprintf(f,"\tdsource\t\"%s\"\n",errfname);
  1495.             fprintf(f,"\tdebug\t%d\n",act_line);
  1496.         }
  1497.     }
  1498.     reglabel=++label;freglabel=++label;
  1499.     function_top(f,v,zl2l(offset));
  1500.     if(p!=first_ic) ierror(0);
  1501.     cc_set=cc_set_tst=0;
  1502.     stackoffset=notpopped=dontpop=0;
  1503.     for(;p;pr(f,p),p=p->next){
  1504.         if(dbout){
  1505.         /*  Hier soll spaeter mal das Sourcefile angegeben werden.  */
  1506.             if(p->file&&p->file!=act_file) ierror(0);
  1507.             if(p->line&&p->line!=act_line){
  1508.                 act_line=p->line;
  1509.                 if(!gas) fprintf(f,"\tdebug\t%d\n",act_line);
  1510.             }
  1511.         }
  1512.         c=p->code;t=p->typf;
  1513.         if(c==NOP) continue;
  1514.         cc_set_tst=cc_set;
  1515.         cc_typ_tst=cc_typ;
  1516.         if(cc_set_tst&&(DEBUG&512)){fprintf(f,"; cc_set_tst=");probj2(f,cc_set_tst,t);fprintf(f,"\n");}
  1517.         if(cc_set&&(DEBUG&512)){fprintf(f,"; cc_set=");probj2(f,cc_set,t);fprintf(f,"\n");}
  1518.         pushedreg&=16;if(c==RESTOREREGS) pushedreg=0;
  1519.         if(DEBUG&256){fprintf(f,"; "); pric2(f,p);}
  1520.         if(DEBUG&512) fprintf(f,"; stackoffset=%ld, notpopped=%ld, pushedreg=%d, dontpop=%ld\n",stackoffset,notpopped,pushedreg,dontpop);
  1521.         /*  muessen wir Argumente poppen?   */
  1522.         if(notpopped&&!dontpop){
  1523.             int flag=0;
  1524.             if(c==LABEL||c==COMPARE||c==TEST||c==BRA){
  1525.                 fprintf(f,"\tadd%s.%s\t#%ld,a7\n",quick[notpopped<=8],strshort[notpopped<32768],notpopped);
  1526.                 stackoffset+=notpopped;notpopped=0;/*cc_set_tst=cc_set=0;*/
  1527.             }
  1528.         }
  1529.         /*  na, ob das hier ok ist..?   */
  1530.         if(c==SUBPFP) c=SUB;
  1531.         if(c==PMULT) c=MULT;
  1532.         if(c==ALLOCREG) {regs[p->q1.reg]=1;continue;}
  1533.         if(c==FREEREG) {regs[p->q1.reg]=0;continue;}
  1534.         if(c==LABEL){
  1535.             if(dbout) act_line=0;
  1536.             if(gas){
  1537.                 fprintf(f,"l%d:\n",t);
  1538.             }else{
  1539.                 fprintf(f,"l%d\n",t);
  1540.             }
  1541.             cc_set=0;continue;
  1542.         }
  1543.         if(c==BRA){fprintf(f,"\t%sbra\tl%d\n",(gas?"j":""),t);continue;}
  1544.         if(c>=BEQ&&c<BRA){
  1545.             if(gas){
  1546.                 if(stored_cc){fprintf(f,"\tjne\tl%d\n",t);stored_cc=0;continue;}
  1547.                 if((comptyp&UNSIGNED)||(comptyp&NQ)==POINTER){
  1548.                     fprintf(f,"\tj%s\tl%d\n",ubranch[c-BEQ],t);
  1549.                 }else{
  1550.                     fprintf(f,"\t%sj%s\tl%d\n",fp,ename[c]+1,t);
  1551.                 }
  1552.             }else{
  1553.                 if(stored_cc){fprintf(f,"\tbne\tl%d\n",t);stored_cc=0;continue;}
  1554.                 if((comptyp&UNSIGNED)||(comptyp&NQ)==POINTER){
  1555.                     fprintf(f,"\tb%s\tl%d\n",ubranch[c-BEQ],t);
  1556.                 }else{
  1557.                     fprintf(f,"\t%s%s\tl%d\n",fp,ename[c],t);
  1558.                 }
  1559.             }
  1560.             continue;
  1561.         }
  1562.         if(p->q1.am){
  1563.             if(!regs[p->q1.am->basereg]){pric2(stdout,p);printf("%s\n",regnames[p->q1.am->basereg]); ierror(0);}
  1564.             if(p->q1.am->dreg&&!regs[p->q1.am->dreg&127]) {printf("Register %s:\n",regnames[p->q1.am->dreg&127]);ierror(0);}
  1565.         }
  1566.         if(p->q2.am){
  1567.             if(!regs[p->q2.am->basereg]) ierror(0);
  1568.             if(p->q2.am->dreg&&!regs[p->q2.am->dreg&127]) {printf("Register %s:\n",regnames[p->q2.am->dreg&127]);ierror(0);}
  1569.         }
  1570.         if(p->z.am){
  1571.             if(!regs[p->z.am->basereg]) ierror(0);
  1572.             if(p->z.am->dreg&&!regs[p->z.am->dreg&127]) {printf("Register %s:\n",regnames[p->z.am->dreg&127]);ierror(0);}
  1573.         }
  1574.         if((p->q1.flags®)&&!regs[p->q1.reg]){printf("Register %s:\n",regnames[p->q1.reg]);ierror(0);}
  1575.         if((p->q2.flags®)&&!regs[p->q2.reg]){printf("Register %s:\n",regnames[p->q2.reg]);ierror(0);}
  1576.         if((p->z.flags®)&&!regs[p->z.reg]){printf("Register %s:\n",regnames[p->z.reg]);ierror(0);}
  1577.         if((p->q2.flags®)&&(p->z.flags®)&&p->q2.reg==p->z.reg){pric2(stdout,p);ierror(0);}
  1578.         if((p->q2.flags&VAR)&&(p->z.flags&VAR)&&p->q2.v==p->z.v){pric2(stdout,p);ierror(0);}
  1579.         /*  COMPARE #0 durch TEST ersetzen (erlaubt, da tst alle Flags setzt)   */
  1580.         if(c==COMPARE&&(p->q2.flags&KONST)){
  1581.             eval_const(&p->q2.val,t);
  1582.             if(zleqto(l2zl(0L),vlong)&&zuleqto(ul2zul(0UL),vulong)&&zdeqto(d2zd(0.0),vdouble)){
  1583.                 c=p->code=TEST;p->q2.flags=0;
  1584.             }
  1585.         }
  1586.         if(c==COMPARE&&(p->q1.flags&KONST)){
  1587.             eval_const(&p->q1.val,t);
  1588.             if(zleqto(l2zl(0L),vlong)&&zuleqto(ul2zul(0UL),vulong)&&zdeqto(d2zd(0.0),vdouble)){
  1589.                 struct IC *bp=p->next;int bc;
  1590.                 c=p->code=TEST;p->q1=p->q2;p->q2.flags=0;p->q2.am=0;
  1591.                 /*  Nachfolgenden Branch umdrehen   */
  1592.                 while(bp&&bp->code==FREEREG) bp=bp->next;
  1593.                 bc=bp->code;
  1594.                 if(!bp||bc<BEQ||bc>BGT) ierror(0);
  1595.                 if(bc==BLT) bp->code=BGT;
  1596.                 if(bc==BGT) bp->code=BLT;
  1597.                 if(bc==BLE) bp->code=BGE;
  1598.                 if(bc==BGE) bp->code=BLE;
  1599.             }
  1600.         }
  1601.         /*  gesetzte ConditionCodes merken  */
  1602.         if(p->z.flags&&(!isreg(z)||p->z.reg>=9)&&c!=CONVFLOAT&&c!=CONVDOUBLE&&(((t&NQ)!=FLOAT&&(t&NQ)!=DOUBLE)||g_flags_val[1].l>68000)){
  1603.              cc_set=&p->z;cc_typ=p->typf;
  1604.         }else{
  1605.             cc_set=0;
  1606.         }
  1607.         if(c==PEA){
  1608.             fprintf(f,"\tpea\t");probj2(f,&p->q1,t);fprintf(f,"\n");
  1609.             stackoffset-=zl2l(p->q2.val.vlong);
  1610.             dontpop+=zl2l(p->q2.val.vlong);
  1611.             continue;
  1612.         }
  1613.         if(c==MOVEFROMREG){
  1614.             if(p->q1.reg<17) fprintf(f,"\tmove.l\t%s,",regnames[p->q1.reg]);
  1615.                 else         fprintf(f,"\tfmove.x\t%s,",regnames[p->q1.reg]);
  1616.             probj2(f,&p->z,t);fprintf(f,"\n");
  1617.             continue;
  1618.         }
  1619.         if(c==MOVETOREG){
  1620.             if(p->z.reg<17) fprintf(f,"\tmove.l\t");
  1621.                 else        fprintf(f,"\tfmove.x\t");
  1622.             probj2(f,&p->q1,t);fprintf(f,",%s\n",regnames[p->z.reg]);
  1623.             continue;
  1624.         }
  1625.         if(g_flags[9]&USEDFLAG)
  1626.             if(p->q1.am||p->q2.am||p->z.am){
  1627.                 ierror(0);
  1628.                 p->q1.am=p->q2.am=p->z.am=0;
  1629.             }
  1630.         p=do_refs(f,p);
  1631.         if(g_flags[9]&USEDFLAG)
  1632.             if(p->q1.am||p->q2.am||p->z.am){
  1633.                 ierror(0);
  1634.                 p->q1.am=p->q2.am=p->z.am=0;
  1635.             }
  1636.         if(c>=CONVCHAR&&c<=CONVULONG){
  1637.             int to;
  1638.             if(c==CONVCHAR) to=CHAR;
  1639.             if(c==CONVUCHAR) to=UNSIGNED|CHAR;
  1640.             if(c==CONVSHORT) to=SHORT;
  1641.             if(c==CONVUSHORT) to=UNSIGNED|SHORT;
  1642.             if(c==CONVINT) to=LONG;
  1643.             if(c==CONVUINT) to=UNSIGNED|LONG;
  1644.             if(c==CONVLONG) to=LONG;
  1645.             if(c==CONVULONG) to=UNSIGNED|LONG;
  1646.             if(c==CONVFLOAT) to=FLOAT;
  1647.             if(c==CONVDOUBLE) to=DOUBLE;
  1648.             if(c==CONVPOINTER) to=UNSIGNED|LONG;
  1649.             if(c==CONVVOID){ierror(0);continue;}
  1650.             if(t==FLOAT||t==DOUBLE||to==FLOAT||to==DOUBLE){
  1651.                 if(g_flags_val[1].l>=68000){
  1652.                     int zreg=0;
  1653.                     if((t==FLOAT||t==DOUBLE)&&(to==FLOAT||to==DOUBLE)){
  1654.                         if(isreg(q1)&&isreg(z)){
  1655.                             if(p->q1.reg!=p->z.reg)
  1656.                                 fprintf(f,"\tfmove.x\t%s,%s\n",regnames[p->q1.reg],regnames[p->z.reg]);
  1657.                             continue;
  1658.                         }
  1659.                     }
  1660.                     if(isreg(z)&&p->z.reg>=17)
  1661.                         zreg=p->z.reg;
  1662.                     if(isreg(q1)&&p->q1.reg>=17){
  1663.                         if(!zreg) zreg=p->q1.reg; else zreg=get_reg(f,2,p);}
  1664.                     if(!zreg) zreg=get_reg(f,2,p);
  1665.                     if((to&UNSIGNED)&&x_t[to&NQ]!='l'){
  1666.                         int dreg=get_reg(f,1,p);
  1667.                         fprintf(f,"\tmoveq\t#0,%s\n",regnames[dreg]);
  1668.                         move(f,&p->q1,0,0,dreg,to);
  1669.                         move(f,0,dreg,0,zreg,LONG);
  1670.                     }else{
  1671.                         if(!isreg(q1)||p->q1.reg!=zreg)
  1672.                             move(f,&p->q1,0,0,zreg,to);
  1673.                     }
  1674.                     if(t!=FLOAT&&t!=DOUBLE){
  1675.                     /*  nach integer, d.h. Kommastellen abschneiden */
  1676.                         if(g_flags_val[1].l==68040/*||g_flags_val[1].l==68060*/){
  1677.                         /*  bei 040 emuliert    */
  1678.                             int dreg1=get_reg(f,1,p),dreg2=get_reg(f,1,p);
  1679.                             fprintf(f,"\tfmove.l\tfpcr,%s\n",regnames[dreg2]);
  1680.                             fprintf(f,"\tmoveq\t#16,%s\n",regnames[dreg1]);
  1681.                             fprintf(f,"\tor.l\t%s,%s\n",regnames[dreg2],regnames[dreg1]);
  1682.                             fprintf(f,"\tand.w\t#-33,%s\n",regnames[dreg1]);
  1683.                             fprintf(f,"\tfmove.l\t%s,fpcr\n",regnames[dreg1]);
  1684.                             if((t&UNSIGNED)&&(t&NQ)<INT){
  1685.                                 fprintf(f,"\tfmove.l\t%s,%s\n",regnames[zreg],regnames[dreg1]);
  1686.                                 fprintf(f,"\tmove.%c\t%s,",x_t[t&NQ],regnames[dreg1]);
  1687.                             }else{
  1688.                                 fprintf(f,"\tfmove.%c\t%s,",x_t[t&NQ],regnames[zreg]);
  1689.                             }
  1690.                             probj2(f,&p->z,t);fprintf(f,"\n");
  1691.                             fprintf(f,"\tfmove.l\t%s,fpcr\n",regnames[dreg2]);
  1692.                             continue;
  1693.                         }else{
  1694.                             if(!isreg(q1)||p->q1.reg!=zreg){
  1695.                                 fprintf(f,"\tfintrz.x\t%s\n",regnames[zreg]);
  1696.                             }else{
  1697.                                 int nreg=get_reg(f,2,p);
  1698.                                 fprintf(f,"\tfintrz.x\t%s,%s\n",regnames[zreg],regnames[nreg]);
  1699.                                 zreg=nreg;
  1700.                             }
  1701.                             if((t&UNSIGNED)&&(t&NQ)<INT){
  1702.                                 int r;
  1703.                                 if(p->z.flags®) r=p->z.reg; else r=get_reg(f,1,p);
  1704.                                 move(f,0,zreg,0,r,LONG);
  1705.                                 move(f,0,r,&p->z,0,t);
  1706.                             }else{
  1707.                                 move(f,0,zreg,&p->z,0,t);
  1708.                             }
  1709.                             continue;
  1710.                         }
  1711.                     }
  1712.                     if(to&UNSIGNED&&x_t[to&NQ]=='l'){
  1713.                         int nlabel;
  1714.                         fprintf(f,"\ttst.%c\t",x_t[to&NQ]);
  1715.                         probj2(f,&p->q1,to);fprintf(f,"\n");
  1716.                         nlabel=++label;
  1717.                         fprintf(f,"\tbge.s\tl%d\n",nlabel);
  1718.                         fprintf(f,"\tfadd.d\t#4294967296,%s\n",regnames[zreg]);
  1719.                         fprintf(f,"l%d:\n",nlabel);
  1720.                     }
  1721.                     if(!(p->z.reg)||p->z.reg!=zreg){
  1722.                         move(f,0,zreg,&p->z,0,t);
  1723.                     }
  1724.                 }else{
  1725.                     cc_set=0;
  1726.                     if(to==t){
  1727.                         assign(f,p,&p->q1,&p->z,ASSIGN,zl2l(p->q2.val.vlong),t);
  1728.                         continue;
  1729.                     }
  1730.                     if(to==FLOAT&&t==DOUBLE){
  1731.                         saveregs(f,p);
  1732.                         assign(f,p,&p->q1,0,PUSH,msizetab[FLOAT],FLOAT);
  1733.                         if(gas){
  1734.                             fprintf(f,"\t.global\t__ieees2d\n\tjbsr\t__ieees2d\n\taddq.w\t#4,a7\n");
  1735.                         }else{
  1736.                             fprintf(f,"\tpublic\t__ieees2d\n\tjsr\t__ieees2d\n\taddq.w\t#4,a7\n");
  1737.                         }
  1738.                         stackoffset+=4;
  1739.                         restoreregsa(f,p);
  1740.                         fprintf(f,"\tmovem.l\td0/d1,");
  1741.                         probj2(f,&p->z,t);fprintf(f,"\n");
  1742.                         restoreregsd(f,p);
  1743.                         continue;
  1744.                     }
  1745.                     if(to==DOUBLE&&t==FLOAT){
  1746.                         saveregs(f,p);
  1747.                         assign(f,p,&p->q1,0,PUSH,msizetab[DOUBLE],DOUBLE);
  1748.                         if(gas){
  1749.                             fprintf(f,"\t.global\t__ieeed2s\n\tjbsr\t__ieeed2s\n\taddq.w\t#8,a7\n");
  1750.                         }else{
  1751.                             fprintf(f,"\tpublic\t__ieeed2s\n\tjsr\t__ieeed2s\n\taddq.w\t#8,a7\n");
  1752.                         }
  1753.                         stackoffset+=8;
  1754.                         restoreregsa(f,p);
  1755.                         move(f,0,9,&p->z,0,t);
  1756.                         restoreregsd(f,p);
  1757.                         continue;
  1758.                     }
  1759.                     if(to==FLOAT||to==DOUBLE){
  1760.                         int uns;
  1761.                         saveregs(f,p);
  1762.                         if(t&UNSIGNED) uns='u'; else uns='s';
  1763.                         assign(f,p,&p->q1,0,PUSH,sizetab[to&NQ],to);
  1764.                         if(gas){
  1765.                             fprintf(f,"\t.global\t__ieeefix%c%c\n\tjbsr\t__ieeefix%c%c\n\taddq.w\t#%ld,a7\n",x_t[to&NQ],uns,x_t[to&NQ],uns,zl2l(sizetab[to&NQ]));
  1766.                         }else{
  1767.                             fprintf(f,"\tpublic\t__ieeefix%c%c\n\tjsr\t__ieeefix%c%c\n\taddq.w\t#%ld,a7\n",x_t[to&NQ],uns,x_t[to&NQ],uns,zl2l(sizetab[to&NQ]));
  1768.                         }
  1769.                         stackoffset+=sizetab[to&NQ];
  1770.                         restoreregsa(f,p);
  1771.                         move(f,0,9,&p->z,0,t);
  1772.                         restoreregsd(f,p);
  1773.                         continue;
  1774.                     }else{
  1775.                         int uns,xt=x_t[to&NQ];
  1776.                         saveregs(f,p);
  1777.                         if(to&UNSIGNED) uns='u'; else uns='s';
  1778.                         if(xt!='l') {fprintf(f,"\tsubq.w\t#4,a7\n");stackoffset-=4;}
  1779.                         fprintf(f,"\tmove.%c\t",xt);
  1780.                         probj2(f,&p->q1,to);
  1781.                         if(xt!='l') fprintf(f,",(a7)\n"); else {fprintf(f,",-(a7)\n");stackoffset-=4;}
  1782.                         if(gas){
  1783.                             fprintf(f,"\t.global\t__ieeeflt%c%c%c\n\tjbsr\t__ieeeflt%c%c%c\n\taddq.w\t#4,a7\n",uns,xt,x_t[t&NQ],uns,xt,x_t[t&NQ]);
  1784.                         }else{
  1785.                             fprintf(f,"\tpublic\t__ieeeflt%c%c%c\n\tjsr\t__ieeeflt%c%c%c\n\taddq.w\t#4,a7\n",uns,xt,x_t[t&NQ],uns,xt,x_t[t&NQ]);
  1786.                         }
  1787.                         stackoffset+=4;
  1788.                         restoreregsa(f,p);
  1789.                         if(t==DOUBLE){
  1790.                             fprintf(f,"\tmovem.l\td0/d1,");
  1791.                             probj2(f,&p->z,t);fprintf(f,"\n");
  1792.                         }else move(f,0,9,&p->z,0,t);
  1793.                         restoreregsd(f,p);
  1794.                         continue;
  1795.                     }
  1796.                 }
  1797.                 continue;
  1798.             }
  1799.             if((to&NQ)<(t&NQ)){
  1800.                 int zreg;
  1801.                 if(isreg(z)&&p->z.reg>=9&&p->z.reg<=16)
  1802.                     zreg=p->z.reg; else zreg=get_reg(f,1,p);
  1803.                 /*  aufpassen, falls unsigned und Quelle==Ziel  */
  1804.                 if((to&UNSIGNED)&&isreg(q1)&&zreg==p->q1.reg){
  1805.                     unsigned long l;
  1806.                     if((to&NQ)==CHAR) l=0xff; else l=0xffff;
  1807.                     fprintf(f,"\tand.%c\t#%lu,%s\n",x_t[t&NQ],l,regnames[zreg]);
  1808.                     continue;
  1809.                 }
  1810.                 if(to&UNSIGNED) fprintf(f,"\tmoveq\t#0,%s\n",regnames[zreg]);
  1811.                 move(f,&p->q1,0,0,zreg,to);
  1812.                 if(!(to&UNSIGNED)){
  1813.                     if((to&NQ)==CHAR&&(t&NQ)==SHORT) fprintf(f,"\text.w\t%s\n",regnames[zreg]);
  1814.                     if((to&NQ)==SHORT&&msizetab[t&NQ]==4) fprintf(f,"\text.l\t%s\n",regnames[zreg]);
  1815.                     if((to&NQ)==CHAR&&msizetab[t&NQ]==4){
  1816.                         if(g_flags_val[0].l>=68020)
  1817.                             fprintf(f,"\textb.l\t%s\n",regnames[zreg]);
  1818.                         else
  1819.                             fprintf(f,"\text.w\t%s\n\text.l\t%s\n",regnames[zreg],regnames[zreg]);
  1820.                     }
  1821.                 }
  1822.                 if(!isreg(z)||p->z.reg!=zreg){
  1823.                     move(f,0,zreg,&p->z,0,t);
  1824.                 }
  1825.             }else{
  1826.                 long diff;int m;
  1827.                 m=0;
  1828.                 if(p->q1.flags®){
  1829.                     p->q1.val.vlong=l2zl(0L);
  1830.                     p->q1.flags|=D16OFF;m=1;
  1831.                 }
  1832.                 diff=msizetab[to&NQ]-msizetab[t&NQ];
  1833.                 vlong=l2zl(diff);
  1834.                 p->q1.val.vlong=zladd(p->q1.val.vlong,vlong);
  1835.                 move(f,&p->q1,0,&p->z,0,t);
  1836.                 vlong=l2zl(diff);
  1837.                 p->q1.val.vlong=zlsub(p->q1.val.vlong,vlong);
  1838.                 if(m) p->q1.flags&=~D16OFF;
  1839.             }
  1840.             continue;
  1841.         }
  1842.         if((t==FLOAT||t==DOUBLE)&&g_flags_val[1].l>=68000) *fp='f'; else *fp=0;
  1843.         if(c==MINUS||c==KOMPLEMENT){
  1844.             int zreg;
  1845.             if(t==FLOAT||t==DOUBLE){
  1846.                 if(g_flags_val[1].l>=68000){
  1847.                     if(isreg(z)) zreg=p->z.reg; else zreg=get_reg(f,2,p);
  1848.                     fprintf(f,"\tfneg.");
  1849.                     if(isreg(q1)) fprintf(f,"x\t%s",regnames[p->q1.reg]);
  1850.                         else    {fprintf(f,"%c\t",x_t[t&NQ]);probj2(f,&p->q1,t);}
  1851.                     fprintf(f,",%s\n",regnames[zreg]);
  1852.                     if(!isreg(z)||p->z.reg!=zreg){
  1853.                         move(f,0,zreg,&p->z,0,t);
  1854.                     }
  1855.                     continue;
  1856.                 }else{
  1857.                     saveregs(f,p);
  1858.                     assign(f,p,&p->q1,0,PUSH,msizetab[t&NQ],t);
  1859.                     if(gas){
  1860.                         fprintf(f,"\t.global\t__ieeeneg%c\n\tjbsr\t__ieeeneg%c\n\taddq.w\t#%ld,a7\n",x_t[t&NQ],x_t[t&NQ],msizetab[t&NQ]);
  1861.                     }else{
  1862.                         fprintf(f,"\tpublic\t__ieeeneg%c\n\tjsr\t__ieeeneg%c\n\taddq.w\t#%ld,a7\n",x_t[t&NQ],x_t[t&NQ],msizetab[t&NQ]);
  1863.                     }
  1864.                     stackoffset+=msizetab[t&NQ];
  1865.                     restoreregsa(f,p);
  1866.                     if(t==DOUBLE){
  1867.                         fprintf(f,"\tmovem.l\td0/d1,");
  1868.                         probj2(f,&p->z,t);fprintf(f,"\n");
  1869.                     }else move(f,0,9,&p->z,0,t);
  1870.                     restoreregsd(f,p);
  1871.                     continue;
  1872.                 }
  1873.             }
  1874.             if(compare_objects(&p->q1,&p->z)){
  1875.                 fprintf(f,"\t%s.%c\t",ename[c],x_t[t&NQ]);
  1876.                 probj2(f,&p->q1,t);fprintf(f,"\n");
  1877.                 continue;
  1878.             }
  1879.             if(isreg(z)&&p->z.reg>=9/*&&p->z.reg<=16*/)
  1880.                 zreg=p->z.reg; else zreg=get_reg(f,1,p);
  1881.             if(!isreg(q1)||p->q1.reg!=zreg){
  1882.                 move(f,&p->q1,0,0,zreg,t);
  1883.             }
  1884.             fprintf(f,"\t%s.%c\t%s\n",ename[c],x_t[t&NQ],regnames[zreg]);
  1885.             if(!isreg(z)||p->z.reg!=zreg){
  1886.                 move(f,0,zreg,&p->z,0,t);
  1887.             }
  1888.             continue;
  1889.         }
  1890.         if(c==SETRETURN){
  1891.         /*  Returnwert setzen - q2.val.vlong==size, z.reg==Returnregister */
  1892.             if((t&NQ)==DOUBLE&&p->z.reg==9){
  1893.                 if(p->q1.flags&KONST){
  1894.                     unsigned char *ip=(unsigned char *)&p->q1.val.vdouble;
  1895.                     char *s;
  1896.                     if(gas) s="0x"; else s="$";
  1897.                     fprintf(f,"\tmove.l\t#%s%02x%02x%02x%02x,d0\n",s,ip[0],ip[1],ip[2],ip[3]);
  1898.                     fprintf(f,"\tmove.l\t#%s%02x%02x%02x%02x,d1\n",s,ip[4],ip[5],ip[6],ip[7]);
  1899.                     continue;
  1900.                 }
  1901.                 if(isreg(q1)){
  1902.                     fprintf(f,"\tfmove.d\t%s,-(a7)\n\tmovem.l\t(a7)+",regnames[p->q1.reg]);
  1903.                 }else{
  1904.                     fprintf(f,"\tmovem.l\t");probj2(f,&p->q1,t);
  1905.                 }
  1906.                 fprintf(f,",d0/d1\n");
  1907.                 continue;
  1908.             }
  1909.             if(((t&NQ)==STRUCT||(t&NQ)==UNION)&&p->z.reg==9){
  1910.                 long l=zl2l(p->q2.val.vlong);
  1911.                 fprintf(f,"\tmovem.l\t");probj2(f,&p->q1,t);
  1912.                 fprintf(f,",d0");
  1913.                 if(l>=8) fprintf(f,"/d1");
  1914.                 if(l>=12) fprintf(f,"/a0");
  1915.                 if(l>=16) fprintf(f,"/a1");
  1916.                 fprintf(f,"\n");
  1917.                 continue;
  1918.             }
  1919.         /*  Wenn Returnwert ueber Zeiger gesetzt wird, nichts noetig    */
  1920.             if(p->z.reg) move(f,&p->q1,0,0,p->z.reg,p->typf);
  1921.             continue;
  1922.         }
  1923.         if(c==GETRETURN){
  1924.         /*  Returnwert holen - q2.val.vlong==size, q1.reg==Returnregister     */
  1925.             if((t&NQ)==DOUBLE&&p->q1.reg==9){
  1926.                 fprintf(f,"\tmovem.l\td0/d1");
  1927.                 if(isreg(z)){
  1928.                     fprintf(f,",-(a7)\n\tfmove.d\t(a7)+,%s\n",regnames[p->z.reg]);
  1929.                 }else{
  1930.                     fprintf(f,",");probj2(f,&p->z,t);fprintf(f,"\n");
  1931.                 }
  1932.                 continue;
  1933.             }
  1934.             if(((t&NQ)==STRUCT||(t&NQ)==UNION)&&p->q1.reg==9){
  1935.                 long l=zl2l(p->q2.val.vlong);
  1936.                 fprintf(f,"\tmovem.l\t");
  1937.                 fprintf(f,"d0");
  1938.                 if(l>=8) fprintf(f,"/d1");
  1939.                 if(l>=12) fprintf(f,"/a0");
  1940.                 if(l>=16) fprintf(f,"/a1");
  1941.                 fprintf(f,",");probj2(f,&p->z,t);fprintf(f,"\n");
  1942.                 continue;
  1943.             }
  1944.  
  1945.         /*  Wenn Returnwert ueber Zeiger gesetzt wird, nichts noetig    */
  1946.             cc_set=0;
  1947.             if(p->q1.reg){
  1948.                 move(f,0,p->q1.reg,&p->z,0,p->typf);
  1949.                 if(!(p->z.flags®)||(p->z.reg!=p->q1.reg&&p->z.reg>=9)){ cc_set=&p->z;cc_typ=p->typf;}
  1950.             }
  1951.             continue;
  1952.         }
  1953.         if(c==CALL){
  1954.       if((p->q1.flags&VAR)&&p->q1.v->fi&&p->q1.v->fi->inline_asm){
  1955.         fprintf(f,"%s\n",p->q1.v->fi->inline_asm);
  1956.       }else{
  1957.             if(gas){
  1958.           fprintf(f,"\tjbsr\t");
  1959.             }else{
  1960.           fprintf(f,"\tjsr\t");
  1961.             }
  1962.             /*  Wenn geta4() aufgerufen wurde, merken.  */
  1963.             if((p->q1.flags&(VAR|DREFOBJ))==VAR&&!strcmp(p->q1.v->identifier,"geta4")&&p->q1.v->storage_class==EXTERN)
  1964.           geta4=1;
  1965.             if((p->q1.flags&(DREFOBJ|REG))==DREFOBJ) ierror(0);
  1966.             probj2(f,&p->q1,t);
  1967.             fprintf(f,"\n");
  1968.       }
  1969.       if(dbout) act_line=0;
  1970.       if(zl2l(p->q2.val.vlong)){
  1971.         notpopped+=zl2l(p->q2.val.vlong);
  1972.         dontpop-=zl2l(p->q2.val.vlong);
  1973.         if(!(g_flags[10]&USEDFLAG)&&!(pushedreg&30)&&stackoffset==-notpopped){
  1974.           /*  Entfernen der Parameter verzoegern  */
  1975.         }else{
  1976.           if(dbout&&!gas){ act_line=p->line; fprintf(f,"\tdebug\t%d\n",act_line);}
  1977.           fprintf(f,"\tadd%s.%s\t#%ld,a7\n",quick[zl2l(p->q2.val.vlong)<=8],strshort[zl2l(p->q2.val.vlong)<32768],zl2l(p->q2.val.vlong));
  1978.           stackoffset+=zl2l(p->q2.val.vlong);
  1979.           notpopped-=zl2l(p->q2.val.vlong);
  1980.         }
  1981.       }
  1982.       continue;
  1983.         }
  1984.         if(c==TEST){
  1985.             /*  ConditionCodes schon gesetzt?   */
  1986.             cc_set=&p->q1;cc_typ=t;
  1987.             comptyp=t;
  1988.             if(cc_set_tst&&t==cc_typ_tst){
  1989.                 struct IC *branch;
  1990.                 if(t&UNSIGNED){
  1991.                     branch=p->next;
  1992.                     while(branch&&(branch->code<BEQ||branch->code>BGT))
  1993.                         branch=branch->next;
  1994.                     if(!branch) ierror(0);
  1995.                     if(branch->code==BLE) branch->code=BEQ;
  1996.                     if(branch->code==BGT) branch->code=BNE;
  1997.                     if(branch->code==BGE) {branch->code=BRA;continue;}
  1998.                     if(branch->code==BLT) {branch->code=NOP;continue;}
  1999.                 }
  2000.                 if(compare_objects(&p->q1,cc_set_tst)&&p->q1.am==cc_set_tst->am&&zleqto(p->q1.val.vlong,cc_set_tst->val.vlong)){
  2001.                     if(DEBUG&512){fprintf(f,"; tst eliminated: cc=");probj2(f,cc_set_tst,t);
  2002.                                   fprintf(f,", q1=");probj2(f,&p->q1,t);fprintf(f,"\n");}
  2003.                     continue;
  2004.                 }
  2005.             }
  2006.             if(g_flags_val[0].l<68020&&isreg(q1)&&p->q1.reg>=1&&p->q1.reg<=8){
  2007.             /*  tst ax gibt es nicht bei <68000 :-( */
  2008.                 if(regavailable(1)){
  2009.                     fprintf(f,"\tmove.%c\t%s,%s\n",x_t[t&NQ],regnames[p->q1.reg],regnames[get_reg(f,1,p)]);
  2010.                 }else{
  2011.                     fprintf(f,"\tcmp.w\t#0,%s\n",regnames[p->q1.reg]);
  2012.                 }
  2013.                 continue;
  2014.             }
  2015.             if((t==DOUBLE||t==FLOAT)&&g_flags_val[1].l<68000){
  2016.             /*  nicht sehr schoen   */
  2017.                 int result=get_reg(f,1,p);
  2018.                 saveregs(f,p);
  2019.                 assign(f,p,&p->q1,0,PUSH,msizetab[t&NQ],t);
  2020.                 if(gas){
  2021.                     fprintf(f,"\t.global\t__ieeetst%c\n\tjbsr\t__ieeetst%c\n\taddq.w\t#%ld,a7\n",x_t[t&NQ],x_t[t&NQ],msizetab[t&NQ]);
  2022.                 }else{
  2023.                     fprintf(f,"\tpublic\t__ieeetst%c\n\tjsr\t__ieeetst%c\n\taddq.w\t#%ld,a7\n",x_t[t&NQ],x_t[t&NQ],msizetab[t&NQ]);
  2024.                 }
  2025.                 stackoffset+=msizetab[t&NQ];
  2026.                 restoreregsa(f,p);
  2027.                 if(result!=9) fprintf(f,"\tmove.l\td0,%s\n",regnames[result]);
  2028.                 fprintf(f,"\ttst.l\t%s\n",regnames[result]);
  2029.                 restoreregsd(f,p);
  2030.                 continue;
  2031.             }
  2032.             if(isreg(q1)&&p->q1.reg>=17){fprintf(f,"\tftst.x\t%s\n",regnames[p->q1.reg]);continue;}
  2033.             fprintf(f,"\t%stst.%c\t",fp,x_t[t&NQ]);probj2(f,&p->q1,t);
  2034.             fprintf(f,"\n");
  2035.             continue;
  2036.         }
  2037.         if(c==ASSIGN||c==PUSH){
  2038.             if(c==ASSIGN&&compare_objects(&p->q1,&p->z)) cc_set=0;
  2039.             if(c==PUSH) dontpop+=zl2l(p->q2.val.vlong);
  2040.             assign(f,p,&p->q1,&p->z,c,zl2l(p->q2.val.vlong),t);
  2041.             continue;
  2042.         }
  2043.         if(c==ADDRESS){
  2044.             int zreg;
  2045.             if(isreg(z)&&p->z.reg>=1&&p->z.reg<=8)
  2046.                 zreg=p->z.reg; else zreg=get_reg(f,0,p);
  2047.             fprintf(f,"\tlea\t");probj2(f,&p->q1,t);
  2048.             fprintf(f,",%s\n",regnames[zreg]);
  2049.             if(!isreg(z)||p->z.reg!=zreg){
  2050.                 move(f,0,zreg,&p->z,0,POINTER);
  2051.             }
  2052.             continue;
  2053.         }
  2054.         if(c==COMPARE){
  2055.             int zreg;
  2056.             comptyp=t;
  2057.             if((p->q1.flags&KONST)||isreg(q2)){
  2058.             /*  evtl. Argumente von cmp und nachfolgendes bcc umdrehen  */
  2059.                 struct IC *n;struct obj m;
  2060.                 n=p->next;
  2061.                 while(n){
  2062.                     if(n->code>=BEQ&&n->code<BRA){
  2063.                         if(!p->z.flags){
  2064.                             if(DEBUG&1) printf("arguments of cmp exchanged\n");
  2065.                             m=p->q1;p->q1=p->q2;p->q2=m;
  2066.                             p->z.flags=1;
  2067.                         }
  2068.                         /*  nachfolgenden Branch umdrehen   */
  2069.                         switch(n->code){
  2070.                             case BGT: n->code=BLT;break;
  2071.                             case BLT: n->code=BGT;break;
  2072.                             case BGE: n->code=BLE;break;
  2073.                             case BLE: n->code=BGE;break;
  2074.                         }
  2075.                         break;
  2076.                     }
  2077.                     if(n->code==FREEREG) n=n->next; else break; /*  compare ohne branch => leerer Block o.ae.   */
  2078.                 }
  2079.             }
  2080.             if(t==FLOAT||t==DOUBLE){
  2081.                 if(g_flags_val[1].l>=68000){
  2082.                     if(isreg(q1)&&p->q1.reg>=17){
  2083.                         zreg=p->q1.reg;
  2084.                     }else{
  2085.                         zreg=get_reg(f,2,p);
  2086.                         move(f,&p->q1,0,0,zreg,t);
  2087.                     }
  2088.                     if(isreg(q2)){fprintf(f,"\tfcmp.x\t%s,%s\n",regnames[p->q2.reg],regnames[zreg]);continue;}
  2089.                     fprintf(f,"\tfcmp.%c\t",x_t[t&NQ]);probj2(f,&p->q2,t);
  2090.                     fprintf(f,",%s\n",regnames[zreg]);
  2091.                     continue;
  2092.                 }else{
  2093.                 /*  nicht sehr schoen   */
  2094.                     int result=get_reg(f,1,p);
  2095.                     saveregs(f,p);
  2096.                     assign(f,p,&p->q2,0,PUSH,msizetab[t&NQ],t);
  2097.                     assign(f,p,&p->q1,0,PUSH,msizetab[t&NQ],t);
  2098.                     if(gas){
  2099.                         fprintf(f,"\t.global\t__ieeecmp%c\n\tjbsr\t__ieeecmp%c\n\tadd.w\t#%ld,a7\n",x_t[t&NQ],x_t[t&NQ],2*msizetab[t&NQ]);
  2100.                     }else{
  2101.                         fprintf(f,"\tpublic\t__ieeecmp%c\n\tjsr\t__ieeecmp%c\n\tadd.w\t#%ld,a7\n",x_t[t&NQ],x_t[t&NQ],2*msizetab[t&NQ]);
  2102.                     }
  2103.                     stackoffset+=2*msizetab[t&NQ];
  2104.                     restoreregsa(f,p);
  2105.                     if(result!=9) fprintf(f,"\tmove.l\td0,%s\n",regnames[result]);
  2106.                     fprintf(f,"\ttst.l\t%s\n",regnames[result]);
  2107.                     restoreregsd(f,p);
  2108.                     continue;
  2109.                 }
  2110.             }
  2111.             if(p->q2.flags&KONST){
  2112.                 fprintf(f,"\tcmp.%c\t",x_t[t&NQ]);probj2(f,&p->q2,t);
  2113.                 fprintf(f,",");probj2(f,&p->q1,t);fprintf(f,"\n");
  2114.                 continue;
  2115.             }
  2116.             if(isreg(q1)){
  2117.                 zreg=p->q1.reg;
  2118.             }else{
  2119.                 zreg=get_reg(f,1,p);    /* hier evtl. auch Adressregister nehmen */
  2120.                 move(f,&p->q1,0,0,zreg,t);
  2121.             }
  2122.             fprintf(f,"\tcmp.%c\t",x_t[t&NQ]);probj2(f,&p->q2,t);
  2123.             fprintf(f,",%s\n",regnames[zreg]);
  2124.             continue;
  2125.         }
  2126.         if(c==ADDI2P||c==SUBIFP){
  2127.             int zreg,r;
  2128.             if(isreg(q1)&&p->q1.reg<=8&&isreg(z)&&p->z.reg<=8&&p->q1.reg!=p->z.reg){
  2129.             /*  q1 und z Adressregister => lea nehmen   */
  2130.                 if(p->q2.flags&KONST){
  2131.                     eval_const(&p->q2.val,t);
  2132.                     if(c==SUBIFP) vlong=zlsub(l2zl(0L),vlong);
  2133.                     if(g_flags_val[0].l>=68020||(zlleq(vlong,l2zl(32767))&&zlleq(l2zl(-32768),vlong))){
  2134.                         fprintf(f,"\tlea\t(%ld,%s),%s\n",zl2l(vlong),regnames[p->q1.reg],regnames[p->z.reg]);
  2135.                         continue;
  2136.                     }
  2137.                 }else if(c==ADDI2P&&isreg(q2)){
  2138.                     fprintf(f,"\tlea\t(%s,%s.%c),%s\n",regnames[p->q1.reg],regnames[p->q2.reg],x_t[t&NQ],regnames[p->z.reg]);
  2139.                     continue;
  2140.                 }
  2141.             }
  2142.             if(compare_objects(&p->q1,&p->z)){
  2143.                 if(p->q2.flags&KONST){
  2144.                     if(c==ADDI2P)
  2145.                         fprintf(f,"\tadd%s.l\t",quick[isquickkonst2(&p->q2.val,t)]);
  2146.                     else
  2147.                         fprintf(f,"\tsub%s.l\t",quick[isquickkonst2(&p->q2.val,t)]);
  2148.                     probj2(f,&p->q2,t);fprintf(f,",");
  2149.                     probj2(f,&p->z,POINTER);fprintf(f,"\n");
  2150.                     continue;
  2151.                 }
  2152.                 if(isreg(q1)&&(x_t[t&NQ]=='l'||p->q1.reg<=8)){
  2153.                     if(c==ADDI2P)
  2154.                         fprintf(f,"\tadd.%c\t",x_t[t&NQ]);
  2155.                     else
  2156.                         fprintf(f,"\tsub.%c\t",x_t[t&NQ]);
  2157.                     probj2(f,&p->q2,t);fprintf(f,",%s\n",regnames[p->z.reg]);
  2158.                     continue;
  2159.                 }
  2160.                 if(isreg(q2)&&p->q2.reg>=1){
  2161.                     r=p->q2.reg;
  2162.                 }else{
  2163.                     r=get_reg(f,1,p);
  2164.                     move(f,&p->q2,0,0,r,t);
  2165.                 }
  2166.                 if(x_t[t&NQ]!='l'&&(!isreg(z)||p->z.reg<1||p->z.reg>8)){
  2167.                 /*  wenn Ziel kein Adressregister, muss short erst auf long */
  2168.                 /*  char darf hier nicht auftreteten und long passt schon   */
  2169.                     if(t&UNSIGNED) fprintf(f,"\tswap\t%s\n\tclr.w\t%s\n\tswap\t%s\n",regnames[r],regnames[r],regnames[r]);
  2170.                      else          fprintf(f,"\text.l\t%s\n",regnames[r]);
  2171.                     t=POINTER;
  2172.                 }
  2173. /*                if(c==ADDI2P)
  2174.                     fprintf(f,"\tadd.%c\t%s,",x_t[t&NQ],regnames[r]);
  2175.                 else
  2176.                     fprintf(f,"\tsub.%c\t%s,",x_t[t&NQ],regnames[r]);
  2177.                 probj2(f,&p->z,t);fprintf(f,"\n");*/
  2178.                 if(c==ADDI2P) add(f,0,r,&p->z,0,t);
  2179.                  else         sub(f,0,r,&p->z,0,t);
  2180.                 continue;
  2181.             }
  2182.             if(isreg(z)&&p->z.reg>=1&&p->z.reg<=16)
  2183.                 zreg=p->z.reg; else zreg=get_reg(f,0,p);
  2184.             /*  Spezialfall, falls Ziel Datenregister und short */
  2185.             /*  nicht schoen, aber auf die Schnelle...          */
  2186.             if(x_t[t&NQ]!='l'&&zreg>8){
  2187.                 move(f,&p->q2,0,0,zreg,t);
  2188.                 if(t&UNSIGNED) fprintf(f,"\tswap\t%s\n\tclr.w\t%s\n\tswap\t%s\n",regnames[zreg],regnames[zreg],regnames[zreg]);
  2189.                  else          fprintf(f,"\text.l\t%s\n",regnames[zreg]);
  2190.                 if(c==SUBIFP) fprintf(f,"\tneg.l\t%s\n",regnames[zreg]);
  2191.                 add(f,&p->q1,0,0,zreg,POINTER);
  2192.                 if(!isreg(z)||p->z.reg!=zreg)
  2193.                     move(f,0,zreg,&p->z,0,POINTER);
  2194.                 continue;
  2195.             }
  2196.             if(!isreg(q1)||p->q1.reg!=zreg){
  2197.                 move(f,&p->q1,0,0,zreg,POINTER);
  2198.             }
  2199.             if(c==ADDI2P) add(f,&p->q2,0,0,zreg,t);
  2200.              else         sub(f,&p->q2,0,0,zreg,t);
  2201.             if(!isreg(z)||p->z.reg!=zreg){
  2202.                 move(f,0,zreg,&p->z,0,POINTER);
  2203.             }
  2204.             continue;
  2205.         }
  2206.         if((c>=OR&&c<=AND)||(c>=LSHIFT&&c<=MOD)){
  2207.             int zreg,q1reg,q2reg;
  2208.             if((p->q2.flags&KONST)&&
  2209.                (!(p->q1.flags®)||!(p->z.flags®)||p->q1.reg!=p->z.reg)&&
  2210.                (!(p->q1.flags&VAR)||!(p->z.flags&VAR)||p->q1.v!=p->z.v)&&
  2211.                ((c>=OR&&c<=AND)||c==ADD||c==MULT)){
  2212.                 struct obj o;
  2213.                 if(c==MULT){
  2214.                     eval_const(&p->q2.val,t);
  2215.                     if(zlleq(l2zl(0L),vlong)&&zulleq(ul2zul(0UL),vulong)&&!pof2(vulong)){
  2216.                         o=p->q1;p->q1=p->q2;p->q2=o;
  2217.                     }
  2218.                 }else{
  2219.                     o=p->q1;p->q1=p->q2;p->q2=o;
  2220.                 }
  2221.             }
  2222.             if(t==FLOAT||t==DOUBLE){
  2223.                 if(g_flags_val[1].l>=68000){
  2224.                     if(isreg(z)&&p->z.reg>=17) zreg=p->z.reg;
  2225.                         else zreg=get_reg(f,2,p);
  2226.                     if(!isreg(q1)||p->q1.reg!=p->z.reg)
  2227.                         move(f,&p->q1,0,0,zreg,t);
  2228.                     fprintf(f,"\tf%s.",ename[c]);
  2229.                     if(isreg(q2)) fprintf(f,"x\t");
  2230.                         else      fprintf(f,"%c\t",x_t[t&NQ]);
  2231.                     probj2(f,&p->q2,t);
  2232.                     fprintf(f,",%s\n",regnames[zreg]);
  2233.                     if(!isreg(z)||p->z.reg!=zreg){
  2234.                         move(f,0,zreg,&p->z,0,t);
  2235.                     }
  2236.                     continue;
  2237.                 }else{
  2238.                     saveregs(f,p);
  2239.                     assign(f,p,&p->q2,0,PUSH,msizetab[t&NQ],t);
  2240.                     assign(f,p,&p->q1,0,PUSH,msizetab[t&NQ],t);
  2241.                     if(gas){
  2242.                         fprintf(f,"\t.global\t__ieee%s%c\n\tjbsr\t__ieee%s%c\n\tadd.w\t#%ld,a7\n",ename[c],x_t[t&NQ],ename[c],x_t[t&NQ],2*msizetab[t&NQ]);
  2243.                     }else{
  2244.                         fprintf(f,"\tpublic\t__ieee%s%c\n\tjsr\t__ieee%s%c\n\tadd.w\t#%ld,a7\n",ename[c],x_t[t&NQ],ename[c],x_t[t&NQ],2*msizetab[t&NQ]);
  2245.                     }
  2246.                     stackoffset+=2*msizetab[t&NQ];
  2247.                     restoreregsa(f,p);
  2248.                     if(t==DOUBLE){
  2249.                         fprintf(f,"\tmovem.l\td0/d1,");
  2250.                         probj2(f,&p->z,t);fprintf(f,"\n");
  2251.                     }else move(f,0,9,&p->z,0,t);
  2252.                     restoreregsd(f,p);
  2253.                     continue;
  2254.                 }
  2255.             }
  2256.             if((c==MULT||c==DIV||(c==MOD&&(p->typf&UNSIGNED)))&&(p->q2.flags&KONST)){
  2257.             /*  ersetzt mul etc. mit Zweierpotenzen     */
  2258.             /*  hier evtl. noch Fehler                  */
  2259.                 long ln;
  2260.                 eval_const(&p->q2.val,t);
  2261.                 if(zlleq(l2zl(0L),vlong)&&zulleq(ul2zul(0UL),vulong)){
  2262.                     if(ln=pof2(vulong)){
  2263.                         if(c==MOD){
  2264.                             vlong=zlsub(vlong,l2zl(1L));
  2265.                             p->code=AND;
  2266.                         }else{
  2267.                             vlong=l2zl(ln-1);
  2268.                             if(c==DIV) p->code=RSHIFT; else p->code=LSHIFT;
  2269.                         }
  2270.                         c=p->code;
  2271.                         if((t&NU)==CHAR) p->q2.val.vchar=zl2zc(vlong);
  2272.                         if((t&NU)==SHORT) p->q2.val.vshort=zl2zs(vlong);
  2273.                         if((t&NU)==INT) p->q2.val.vint=zl2zi(vlong);
  2274.                         if((t&NU)==LONG) p->q2.val.vlong=vlong;
  2275.                         vulong=zl2zul(vlong);
  2276.                         if((t&NU)==(UNSIGNED|CHAR)) p->q2.val.vuchar=zul2zuc(vulong);
  2277.                         if((t&NU)==(UNSIGNED|SHORT)) p->q2.val.vushort=zul2zus(vulong);
  2278.                         if((t&NU)==(UNSIGNED|INT))  p->q2.val.vuint=zul2zui(vulong);
  2279.                         if((t&NU)==(UNSIGNED|LONG)) p->q2.val.vulong=vulong;
  2280.                     }
  2281.                 }
  2282.             }
  2283.             if(c==DIV||c==MOD){
  2284.                 if(x_t[t&NQ]=='l'&&g_flags_val[0].l<68020){
  2285.                 /*  das hier ist auch nicht allzu schoen  */
  2286.                     char *fname;
  2287.                     cc_set=0;   /*  Library-Funktionen setzen cc nicht immer */
  2288.                     saveregs(f,p);
  2289.                     fprintf(f,"\tmove.l\t"); probj2(f,&p->q2,t);
  2290.                     fprintf(f,",-(a7)\n");
  2291.                     stackoffset-=4;
  2292.                     fprintf(f,"\tmove.l\t"); probj2(f,&p->q1,t);
  2293.                     fprintf(f,",-(a7)\n");
  2294.                     stackoffset-=4;
  2295.                     if(c==DIV){
  2296.                         if(t&UNSIGNED) fname="divu"; else fname="divs";
  2297.                     }else{
  2298.                         if(t&UNSIGNED) fname="modu"; else fname="mods";
  2299.                     }
  2300.                     if(gas){
  2301.                         fprintf(f,"\t.global\t__l%s\n\tjbsr\t__l%s\n",fname,fname);
  2302.                     }else{
  2303.                         fprintf(f,"\tpublic\t__l%s\n\tjsr\t__l%s\n",fname,fname);
  2304.                     }
  2305.                     fprintf(f,"\taddq.w\t#8,a7\n");
  2306.                     stackoffset+=8;
  2307.                     restoreregsa(f,p);
  2308.                     move(f,0,9,&p->z,0,t);
  2309.                     restoreregsd(f,p);
  2310.                     continue;
  2311.                 }
  2312.  
  2313.             }
  2314.             /*  hier die zweite Alternative mit isreg() schreiben?  */
  2315.             if(compare_objects(&p->q2,&p->z)){
  2316.                 struct obj m;
  2317.                 if((c>=OR&&c<=AND)||c==ADD||c==SUB){
  2318.                     if(c!=SUB){
  2319.                         m=p->q1;p->q1=p->q2;p->q2=m;
  2320.                     }else{
  2321.                         if(isreg(q2)&&p->q2.reg>=9&&p->q2.reg<=16){
  2322.                             m=p->q1;p->q1=p->q2;p->q2=m;
  2323.                             c=ADD;
  2324.                             fprintf(f,"\tneg.%c\t",x_t[t&NQ]);
  2325.                             probj2(f,&p->q1,t);fprintf(f,"\n");
  2326.                         }
  2327.                     }
  2328.                 }
  2329.             }
  2330.             if(compare_objects(&p->q1,&p->z)){
  2331.                 if((c>=OR&&c<=AND)||c==ADD||c==SUB){
  2332.                     int r;
  2333.                     if(p->q2.flags&KONST){
  2334.                         if(c==ADD) {add(f,&p->q2,0,&p->z,0,t);continue;}
  2335.                         if(c==SUB) {sub(f,&p->q2,0,&p->z,0,t);continue;}
  2336.                         fprintf(f,"\t%s.%c\t",ename[c],x_t[t&NQ]);
  2337.                         probj2(f,&p->q2,t);fprintf(f,",");
  2338.                         probj2(f,&p->z,t);fprintf(f,"\n");
  2339.                         continue;
  2340.                     }
  2341.                     if(!isreg(z)){
  2342.                         if(isreg(q2)&&p->q2.reg>=9&&p->q2.reg<=16)
  2343.                             r=p->q2.reg; else r=get_reg(f,1,p);
  2344.                         if(!isreg(q2)||p->q2.reg!=r){
  2345.                             move(f,&p->q2,0,0,r,t);
  2346.                         }
  2347.                         fprintf(f,"\t%s.%c\t%s,",ename[c],x_t[t&NQ],regnames[r]);
  2348.                         probj2(f,&p->z,t);fprintf(f,"\n");
  2349.                         continue;
  2350.                     }
  2351.                 }
  2352.             }
  2353.             /*  bei xor oder asl (ausser 0<=const<=8) muss q2 in Register   */
  2354.             if(isreg(q2)&&p->q2.reg>=9&&p->q2.reg<=16){
  2355.                 q2reg=p->q2.reg;
  2356.             }else{
  2357.                 if(c==LSHIFT||c==RSHIFT||c==XOR){
  2358.                     eval_const(&p->q2.val,t);
  2359.                     if(c==XOR||!(p->q2.flags&KONST)||!isquickkonst2(&p->q2.val,t)){
  2360.                         q2reg=get_reg(f,1,p);
  2361.                         move(f,&p->q2,0,0,q2reg,t);
  2362.                     }else q2reg=0;
  2363.                 }else{
  2364.                     q2reg=0;
  2365.                 }
  2366.             }
  2367.             if(c==MOD){
  2368.                 int modreg;
  2369.                 modreg=get_reg(f,1,p);
  2370.                 if(isreg(z)&&p->z.reg>=9&&p->z.reg<=16&&p->z.reg!=q2reg)
  2371.                     zreg=p->z.reg; else zreg=get_reg(f,1,p);
  2372.                 move(f,&p->q1,0,0,modreg,t);
  2373.                 if(0 /*g_flags_val[0].l==68060*/){
  2374.                 /*  div?l.l wird da emuliert?   */
  2375.                     fprintf(f,"\tsmi\t%s\n\textb.l\t%s\n",regnames[zreg],regnames[zreg]);
  2376.                     if(t&UNSIGNED) fprintf(f,"\tdivu.%c\t",x_t[t&NQ]); else fprintf(f,"\tdivs.%c\t",x_t[t&NQ]);
  2377.                 }else{
  2378.                     if(t&UNSIGNED) fprintf(f,"\tdivul.%c\t",x_t[t&NQ]); else fprintf(f,"\tdivsl.%c\t",x_t[t&NQ]);
  2379.                 }
  2380.                 probj2(f,&p->q2,t);
  2381.                 fprintf(f,",%s:%s\n",regnames[zreg],regnames[modreg]);
  2382.                 move(f,0,zreg,&p->z,0,t);
  2383.                 cc_set=0;
  2384.                 continue;
  2385.             }
  2386.             if(isreg(z)&&p->z.reg>=9&&p->z.reg<=16&&p->z.reg!=q2reg)
  2387.                 zreg=p->z.reg; else zreg=get_reg(f,1,p);
  2388.             if(isreg(q1)&&p->q1.reg>=9&&p->q1.reg<=16)
  2389.                 q1reg=p->q1.reg; else q1reg=0;
  2390.             if(q1reg!=zreg){
  2391.                 move(f,&p->q1,0,0,zreg,t);
  2392.             }
  2393.             if(c!=MULT&&c!=DIV&&c!=MOD&&c!=ADD&&c!=SUB){
  2394.                 if(c==RSHIFT&&!(t&UNSIGNED)) fprintf(f,"\tasr.%c\t",x_t[t&NQ]);
  2395.                  else fprintf(f,"\t%s.%c\t",ename[c],x_t[t&NQ]);
  2396.                 if(q2reg) fprintf(f,"%s",regnames[q2reg]); else probj2(f,&p->q2,t);
  2397.                 fprintf(f,",%s\n",regnames[zreg]);
  2398.             }else{
  2399.                 if(c==ADD) add(f,&p->q2,q2reg,0,zreg,t);
  2400.                 if(c==SUB) sub(f,&p->q2,q2reg,0,zreg,t);
  2401.                 if(c==MULT||c==DIV||c==MOD) mult(f,&p->q2,q2reg,0,zreg,t,c,p);
  2402.             }
  2403.             if((!isreg(z)||p->z.reg!=zreg)){
  2404.                 move(f,0,zreg,&p->z,0,t);
  2405.             }
  2406.             continue;
  2407.         }
  2408.         ierror(0);
  2409.     }
  2410.     if(notpopped){
  2411.         fprintf(f,"\tadd%s.%s\t#%ld,a7\n",quick[notpopped<=8],strshort[notpopped<32768],notpopped);
  2412.         stackoffset+=notpopped;notpopped=0;
  2413.     }
  2414.     function_bottom(f,v,zl2l(offset));
  2415.     if(pushflag){   /*  Speicher fuer pushlabel generieren - leider im cseg */
  2416.         if(gas){
  2417.             fprintf(f,"\t.lcomm\tl%d,4\n",pushlabel);
  2418.         }else{
  2419.             fprintf(f,"\tcnop\t0,4\nl%d\n\tds.b\t4\n",pushlabel);
  2420.         }
  2421.         pushflag=0;
  2422.     }
  2423. }
  2424.  
  2425. int shortcut(int code,int typ)
  2426. {
  2427.     if(code==COMPARE) return(1);
  2428.     return(0);
  2429. }
  2430.  
  2431. void cleanup_cg(FILE *f)
  2432. {
  2433.     return;
  2434. }
  2435.  
  2436.